牛客OJ：最大子序列和（dp）

状态独立在于，一个已知序列，加不加两边新元素在于，新元素是否小于0.

#include <bits/stdc++.h>
using namespace std;

class Solution {
public:
    int FindGreatestSumOfSubArray(vector<int> array) {
        int l = array.size();
        vector<int> dp;
        dp.push_back(0);
        int ans = 0;
        for(int i=1;i<=l;i++){
            printf("%d\n",dp[i-1]);
            if(dp[i-1]<=0) dp.push_back(array[i-1]);
            else dp.push_back(dp[i-1]+array[i-1]);
            ans = max(ans,dp[i]);
        }
        return ans;
    }
};

int main(){
    int a[] = {1,-2,3,10,-4,7,2,-5};
    vector<int> v(a,a+8);
    Solution S;
    printf("%d\n",S.FindGreatestSumOfSubArray(v));
    return 0;
}