Given a sequence of n integers a1,a2,..., An to find the maximum value of the sequence sub-segment and, for example, when the sequence is -2,11,-4,13,-5,-2, the sequence sub-segment and the maximum is 11-4+13=20.

First, the problem analysis

In the case of violent resolution, the total number of cases considering the sub-paragraph is 1+2+...+n=o (n^2). Considering the dynamic programming algorithm, the complexity of O (n) algorithm can be realized.

Second, the program design

Iii. Results of the procedure

If the sequence is full of negative numbers, it is actually choosing the maximum value

Given a sequence of n integers a1,a2,..., An to find the maximum value of the sequence sub-segment and, for example, when the sequence is -2,11,-4,13,-5,-2, the sequence sub-segment and the maximum is 11-4+13=20.