86人阅读 评论(0)

# Max Sum

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 190308    Accepted Submission(s): 44321

Problem Description
Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.

Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).

Output
For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.

Sample Input
2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5

Sample Output
Case 1:
14 1 4

Case 2:
7 1 6

#include<stdio.h>
int main()
{
int T,n;
int a[100010];
scanf("%d",&T);
int k=1;
int i,x,y,s,e,sum,max;
while(T--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
x=0;y=0;s=0;e=0;
sum=a[0];
max=sum;
for(i=1;i<n;i++)
{
if(sum>=0)
{
y=i;
sum+=a[i];
}
else
{
sum=a[i];
x=i;
y=i;
}
if(sum>max)
{
max=sum;
s=x;
e=y;
}
}
printf("Case %d:\n",k++);
printf("%d %d %d\n",max,s+1,e+1);
if(T)
printf("\n");
}
return 0;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：45778次
• 积分：2658
• 等级：
• 排名：第13734名
• 原创：230篇
• 转载：1篇
• 译文：0篇
• 评论：1条
最新评论