标签:des style blog io color os ar for sp
1 #include <stdio.h> 2 3 int main(){ 4 int T; 5 int n; 6 int number[100001]; 7 int i; 8 int sum; 9 int max; 10 int start; 11 int end; 12 int time; 13 int temp; 14 15 16 scanf("%d",&T); 17 time=1; 18 19 while(T--){ 20 sum=0; 21 max=-1000; 22 start=0; 23 end=0; 24 temp=0; 25 26 scanf("%d",&n); 27 28 for(i=0;i<n;i++) 29 scanf("%d",&number[i]); 30 31 for(i=0;i<n;i++){ 32 sum+=number[i]; 33 34 if(sum>max){ 35 max=sum; 36 start=temp; 37 end=i; 38 } 39 40 if(sum<0){ //关键是这里,当求和小于0时,便把下一个数值作为开头再找最大值 41 sum=0; 42 temp=i+1; 43 } 44 } 45 46 printf("Case %d:\n",time); 47 time++; 48 printf("%d %d %d\n",max,start+1,end+1); 49 if(T!=0) 50 printf("\n"); 51 } 52 53 return 0; 54 }
标签:des style blog io color os ar for sp
原文地址:http://www.cnblogs.com/zqxLonely/p/4062348.html