Maximum subsequence sum (4 methods) I. problem description
Enter a group of integers to obtain the subsequence of the numbers and the medium and maximum values. That is, as long as the sum of the largest subsequences is obtained, the largest sequence does not need to be obtained. For example:
- Sequence:-2 11-4 13-5-2, then the maximum subsequence is 20.
- Sequence:-6 2 4-7 5 3 2-1 6-9 10-2, the maximum subsequence is 16.
II. PHP code implementation
Implementation can refer to: http://www.cnblogs.com/CCBB/archive/2009/04/25/1443455.html
= $ End) {$ max_value = isset ($ data [$ start])? $ Data [$ start]: 0;} else {$ mid = floor ($ start + $ end)/2); list ($ max_left_value, $ max_left_start, $ max_left_end) = findMax3 ($ data, $ start, $ mid); list ($ max_right_value, $ max_right_start, $ max_right_end) = findMax3 ($ data, $ mid + 1, $ end ); // calculate the maximum value on the left $ max_this_value = $ data [$ mid]; $ max_this_start = $ mid; $ max_this_end = $ mid; $ temp = 0; for ($ I = $ max_this_start; $ I >=$ start; $ I --) {$ temp + = $ data [$ I]; if ($ temp> $ max_this_value) {$ max_this_value = $ temp; $ max_this_start = $ I ;}// calculate the maximum value on the right $ temp = $ max_this_value; for ($ I = $ max_this_end + 1; $ I <= $ end; $ I ++) {$ temp + = $ data [$ I]; if ($ temp> $ max_this_value) {$ max_this_value = $ temp; $ max_this_end = $ I ;}$ max_value = $ max_this_value; $ start = $ max_this_start; $ end = $ max_this_end; if ($ max_value <$ max_left_value) {$ max_value = $ max_left_value; $ start = $ max_left_start; $ end = $ max_left_end;} if ($ max_value <$ max_right_value) {$ max_value = $ max_right_value; $ start = $ max_right_start; $ end = $ max_right_end;} return array ($ max_value, $ start, $ end);} // method 4. algorithm O (N) function findMax4 ($ data) {$ max_value = 0; $ thisSum = 0; $ data_len = count ($ data); $ start = 0; $ end = 0; for ($ I = 0; $ I <$ data_len; $ I ++) {$ thisSum + = $ data [$ I]; if ($ thisSum> $ max_value) {$ max_value = $ thisSum; $ end = $ I;} else if ($ thisSum <0) {$ thisSum = 0; $ start = $ I + 1 ;}} return array ($ max_value, $ start, $ end );}III. test
IV. test results
- N = 1000
Test result: n = 1000
- N = 5000
The first solution is too slow during testing.