#include<iostream>
using namespace std;
int GreatestSumOfSubarrays(int *a,int len)
{
int i;
int sumvalue = 0;
int maxvalue = 0x80000000;
for(i = 0;i <len;i++)
{
if(sumvalue <= 0)
sumvalue = a[i];
else
sumvalue += a[i];
if(sumvalue> maxvalue)
maxvalue = sumvalue;
}
return maxvalue;
}
int main()
{
int a[]={-2,-8,-1,-5,-9};
cout<<GreatestSumOfSubarrays(a,sizeof(a)/sizeof(a[0]));
system("pause");
return 0;
}
动态规划之最大子序列和
最新推荐文章于 2022-03-30 23:09:25 发布