int a[]={-1,-4,5,6,-1,7,8}; int themaxsubstr(int*b,int n) { int currmax=0,sum=0;//currmax保存当前最大值,用sum进行数组的遍历 for(int i=0;i<n;i++) { sum+=b[i]; if(sum>currmax)currmax=sum; if(sum<0)sum=0; } return currmax; } int main() { cout<<themaxsubstr(a,7)<<endl; return 0; }
最长子序列问题
猜你喜欢
转载自blog.csdn.net/legends_never_die/article/details/80316038
今日推荐
周排行