动态规划-------最大子段和

/*
b[]的递归式为
b[j]={   b[j-1]+a[j]   ,  b[j-1]>=0
         a[j]          ,  b[j-1]<0      }
*/
#include <iostream>
using namespace std;

int MaxSum(int n, int *a)
{
    int sum=0; 
    int b=0;
    for (int i=0;i<n;i++)
    {
        if (b>0) b+=a[i]; else b=a[i];
        if (b>sum) sum=b;
    }
    return sum;
}

int main()
{
    int a[]={-1,3,-4,5,-3,6,7,-7};
    int sum = MaxSum(8,a);
    cout<<sum<<endl;
    return 0;
}