Thread: Who knows dynamic programming in c ?

Hi, ı have some problem with my dynamic programming assignment. I can do it by using c. But ı don't know how to use dynamic programming.
In the assignment we are asking to find the maximum sequence in a list (such as longest common subsequence)

we have to write an application to decide which group to pick to get the maximum number of subsequence. If we take from one number we can not take from its immediate neighbors.The input will be an array with maximum 40 elements.However we have to do it with dynamic programming.

Example:

insert

Code:

Input: {4,12} Returns: 12 
Input: {10,12,1} Returns: 12 
Input: {1,1,4,4,6,1,1,3,4,6} Returns: 20 – 1,4,6,3 and 6 are picked.

Please help me

It has nothing to do with the language. You can do dynamic programming in any language where you can remember things (that's all "dynamic programming" means).

We won't do your assignment for you, though.

Show us what you've got first.

I wrote it as pseudo code, but not with dynamic programming

sum(A,n): for all n

if n=0, max = 0 else
if n=1, max=A[1] else
max = sum(A[n] + sum(A,n-2), sum(A,n-1))