Alibaba Cloud pen questions: Dynamic Planning for the largest sub-section and Problems

The maximum child segment and the Dynamic Programming solution of the problem. A number is given to find the maximum field and?

For example, array A, the number of integers is N, and B is the secondary array.

A: 2 3 -7 6 4 -5

B: 2 5 -2 6 10 5

The maximum sub-segment is 10.

 

This topic uses the idea of dynamic planning, so that B [J] is the largest subsection and ending with J, so there are:

B [J] = max {B [J-1] + A [J], a [J]}

Therefore, when finding the value of B [J], you only need to check whether B [J-1] is greater than zero, if greater than zero, then B [J] = B [J-1] + A [J]; if less than zero, B [J] = A [J].

In this case, there are n B Values in total. Save the maximum value.

 

Code:

Int maxsum (INT [] A, int N)

{

Int sum = 0;

Int B = 0;

For (INT I = 0; I <n; I ++)

{

If (B> 0)

B + =;

Else

B =;

If (B> sum)

Sum = B;

}

Return sum;

}