Dynamic programming - order of operation

Question

0.00/5 (No votes)

See more:

Hi,

I am learning dynamic programming concepts. I have recently stumbled upon this problem statement -

What I have tried:

I have tried masking the bits and brute force methods, but the results do not match.
Any leads on the approach would be helpful.
I am trying to solve the problem using C#, hence if someone can help me with the approach or solution in C# that would be appreciated so that I can correlate better.

Posted 30-Apr-18 17:12pm

StevensonS

Updated 1-May-18 15:19pm

v3

Add a Solution

Comments

Patrice T 1-May-18 22:01pm

Show your code.

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Patrice T · Accepted Answer · 2018-04-30T17:53:00

Quote:
Dynamic programming - order of operation

This problem is not related to 'Dynamic programming' unless your algorithm is very bad.
All the interest of those challenges is to proof your skills at finding the correct or best algorithm.

This problem is exactly the same as: Distance algorithm - minimum coins required to clear all the level[^] posted yesterday.

Quote:
I am seeking answers to get an insight on the approach to be taken to solve this problem.

Advice: Take a sheet of paper and a pencil and solve the problem by hand. Try bigger samples and see how you find best answer by hand. The way you solve the problem is your algorithm.