摘要： #includeusingnamespacestd;intDP(inta[],intsize){intTempSum,CurSum;CurSum=a[0];intmax=CurSum;for(inti=1;i0){CurSum=(TempSum+a[i])>=a[i]?(TempSum+a[i]):a[i];}else{CurSum=a[i];}if(CurSum>max){max=CurSum;}}returnmax;}intmain(){inta[]={1,-2,3,10,-4,7,2,-5};intresult=DP(a,8);cout<<result<&l 阅读全文