Time
Limit: 2000/1000 MS (Java/Others) Memory Limit:
65536/32768 K (Java/Others)
Total Submission(s):
132258 Accepted Submission(s):
30652
最大连续和sum....运用动态规划思想
1 #include<stdio.h> 2 #include<string.h> 3 #include<stdlib.h> 4 int main() 5 { 6 int n,j,i,num,a,ans,maxc,posst,posen,temp; 7 scanf("%d",&n); 8 for(i=1;i<=n;i++) 9 { 10 scanf("%d",&num); 11 maxc=0; 12 posst=posen=1; 13 ans=-0x3f3f3f3f ; 14 temp=0; 15 for(j=1;j<=num;j++) 16 { 17 scanf("%d",&a); 18 maxc+=a; 19 if(ans<maxc) 20 { 21 ans=maxc; 22 posen=j; 23 posst=temp+1; 24 } 25 if(maxc<0) 26 { 27 maxc=0; 28 temp=j; 29 } 30 } 31 printf("Case %d:\n%d %d %d\n",i,ans,posst,posen); 32 if(i!=n) putchar(10); 33 } 34 return 0; 35 }
HDUOJ--------1003 Max Sum,布布扣,bubuko.com
原文:http://www.cnblogs.com/gongxijun/p/3643656.html