HDU_1003

Max Sum

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

 

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

CODE1 (TIME EXCEED)

#include<stdio.h>
int main()
{
    int n,a[100000],sum=0,p1,p2,t,i,j,max,q=1;
    scanf("%d",&t);
    while(t--)
    {  
        scanf("%d",&n);
        for(i=0;i<n;i++)
            scanf("%d",&a[i]);
         max = a[0];
        for(i=0;i<n;i++)
        {
            for(j=i;j<n;j++)
            {
                sum+=a[j];
                if(sum>max)
                {
                    max=sum;
                    p1=i+1;
                    p2=j+1;
                }
            }
            sum=0;
        }
        printf("Case %d:\n",q++);
        printf("%d %d %d\n",max,p1,p2);
        if(q!=1)
            printf("\n");
    }
    return 0;
}

         
CODE2:

#include<stdio.h>
int main()
{
	int n,a[100000],p1,p2,t,i,maxSum,q=1;
	int maxHere,beginHere,endHere,beginMax,endMax;
	scanf("%d",&t);
	while(t--)
	{  
		scanf("%d",&n);
		for(i=0;i<n;i++)
			scanf("%d",&a[i]);
		maxSum = -2147483647-1;
		maxHere=beginHere=endMax=beginMax=0;
		endHere=-1;
		for(i=0;i<n;i++)
		{
			if(maxHere<0)
			{
				beginHere=i;
				endHere=i;
				maxHere=a[i];
			}
			else
			{
				endHere++;
				maxHere+=a[i];
			}
			if(maxHere>maxSum)
			{
				maxSum=maxHere;
				beginMax=beginHere;
				endMax=endHere;
			}
		}
		printf("Case %d:\n",q++);
		printf("%d %d %d\n",maxSum,beginMax+1,endMax+1);
		if(t)
			printf("\n");
	}
	return 0;
}