Max Sum

HDU-1003

Max Sum

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

25 6 -1 5 4 -77 0 6 -1 1 -6 7 -5

 

Sample Output

Case 1:14 1 4Case 2:7 1 6

#include<iostream>
using namespace std;
int main()
{
	int t,c=0;
	cin>>t;
	while(t--)
	{
		int n,ans=0,a[100005],sum[100005],id[100005];
		cin>>n;
		for(int i=0;i<n;i++)
		cin>>a[i];
		sum[0]=a[0];
		id[0]=0;
		for(int i=1;i<n;i++)
		{
			if(sum[i-1]>=0)
			{
				sum[i]=sum[i-1]+a[i]; 
				id[i]=id[i-1];
			}
			else
			{
				sum[i]=a[i];
				id[i]=i;
			}
			if(sum[i]>sum[ans])
			ans=i;
		}
		cout<<"Case "<<++c<<":"<<endl;
		cout<<sum[ans]<<" "<<id[ans]+1<<" "<<ans+1<<endl;
		if(t)cout<<endl;
	}
}

路过的大神看一下，用Java总是Presentation Error

import java.util.*;
public class t
{
	public static void main(String args[])
	{
		Scanner cin=new Scanner(System.in);
		int t=cin.nextInt(),c=0;
		while(t-->0)
		{
			int ans=0, n=cin.nextInt();
			int []a=new int[n];
			int []sum=new int[n];
			int []id=new int[n];
			for(int i=0;i<n;i++)
				a[i]=cin.nextInt();
			sum[0]=a[0];
			id[0]=0;
			for(int i=1;i<n;i++)
			{
				if(sum[i-1]>=0)
				{
					sum[i]=sum[i-1]+a[i];
					id[i]=id[i-1];
				}
				else
				{
					sum[i]=a[i];
					id[i]=i;
				}
				if(sum[i]>sum[ans])
				ans=i;
			}
			System.out.printf("Case %d:\n",++c);
			System.out.printf("%d %d %d\n",sum[ans],id[ans]+1,ans+1);
			if(t!=0)
				System.out.printf("\n");
		}
	}
}