最大子序列和问题的解(线性时间)
<br />int MaxSubsequenceSum( const int A[ ], int N ){<br /> int ThisSum, MaxSum, j;<br /> ThisSum = MaxSum = 0;<br /> for( j = 0; j < N; j++ ){<br /> ThisSum += A[j];<br /> if( ThisSum > MaxSum )<br /> MaxSum = ThisSum;
原创
2011-04-26 15:58:00 ·
257 阅读 ·
0 评论