求序列的最大连续加权值

分治法 时间花费NlogN

int max3(int maxLeftSum, int maxRightSum, int maxMerge){return maxLeftSum > maxRightSum ? (maxLeftSum > maxMerge ? maxLeftSum : maxMerge) : (maxRightSum > maxMerge ? maxRightSum : maxMerge);}int maxSumRec(const vector &a, int left, int right){if (left == right) // Base caseif (a[left] > 0)return a[left];elsereturn 0;int center = (left + right) / 2;int maxLeftSum = maxSumRec(a, left, center);int maxRightSum = maxSumRec(a, center + 1, right);int maxLeftBorderSum = 0, leftBorderSum = 0;for (int i = center; i >= left; i--){leftBorderSum += a[i];if (leftBorderSum > maxLeftBorderSum)maxLeftBorderSum = leftBorderSum;}int maxRightBorderSum = 0, rightBorderSum = 0;for (int j = center + 1; j <= right; j++){rightBorderSum += a[j];if (rightBorderSum > maxRightBorderSum)maxRightBorderSum = rightBorderSum;}return max3(maxLeftSum, maxRightSum, maxLeftBorderSum + maxRightBorderSum);}int maxSubSum3(const vector &a){return maxSumRec(a, 0, a.size() - 1);}int _tmain(int argc, _TCHAR* argv[]){vector MySubsequence = { 34, -61, 87, 39, 72, 3, -3, 5, 8, 4, 22, -12, 34, 85, 43, 23, 67, 34, 67, 28, -59, 77, 35, 74, 84, 48, 44, 59, 53, 66 };cout<<maxSubSum3(MySubsequence)<<endl;return 0;}

线性扫描 时间花费O(N)

/*线性*/int maxSubSum4(const vector &a){int MaxSub = 0; int thisSub = 0;for (int i = 0; i < a.size(); i++){thisSub += a[i];if (thisSub > MaxSub)MaxSub = thisSub;else if (thisSub < 0)thisSub = 0;}return MaxSub;}