最大连续子序列之和问题(O(n*n)
#include<iostream>#include<stdlib.h>using namespace std;int MaxSubsequenceSum(int a[],int length){ int MaxSum = 0; int ThisSum,SeqStart,SeqEnd; for (int i = 0; i < length; i++) ...
原创
2018-10-12 15:41:18 ·
388 阅读 ·
0 评论