【杭电oj】1003 - Max Sum(最大子序列的和)

版权声明:如果感觉写的不错,转载标明出处链接哦~blog.csdn.net/wyg1997 https://blog.csdn.net/wyg1997/article/details/50821020

Max Sum

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


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
 

Author
Ignatius.L


WA了好多次,以后做最大子序列的和的时候要注意负数序列的可能。

代码如下:

#include <cstdio>
int main()
{
	int u,num = 1;
	int n;
	int max,sum;
	int st,end,t_st,t;
	scanf ("%d",&u);
	while (u--)
	{
		max = -11111;
		sum = 0;
		t_st = 1;
		scanf ("%d",&n);
		for (int i=1;i<=n;i++)
		{
			scanf ("%d",&t);
			sum += t;
			//下面两个if千万不能写反了,之前就是因为这个WA了好多次
			//因为可能出现负数的序列,如果两个if写反,那么max永远不会更新 
			if (sum > max)
			{
				max = sum;
				st = t_st;		//只有出现大于前面的子序列的时候,才能对起始点进行赋值 
				end = i;
			}
			if (sum < 0)
			{
				t_st = i+1;
				sum = 0;
			}
		}
		printf ("Case %d:\n%d %d %d\n",num++,max,st,end);
		if (u)
			printf ("\n");
	}
	return 0;
}


杭电ACM 1003Max Sum

07-02

Max SumrnProblem DescriptionrnGiven 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.rnrn rnrnInputrnThe 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).rnrn rnrnOutputrnFor 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.rnrn rnrnSample Inputrn2rn5 6 -1 5 4 -7rn7 0 6 -1 1 -6 7 -5rn rnrnSample OutputrnCase 1:rn14 1 4rnrnCase 2:rn7 1 6rnrn[color=#FF0000][size=16px]以上是题目:rn我测试了一下我的代码 完全能得到想要的结果 但是杭电那就是一直通不过 显示wrong 希望哪位高手帮我看一下是格式有问题还是特殊情况没有考虑进来rnrnrn以下是我的代码:rn[/size][/color]rn[code=C/C++]#includernint main()rnrn int n,i,j,k=0,K,sum=0,SUM=0,end=0,start=1,flag=0,T=0,J;rn int a[100000];rn while((scanf("%d",&n))!=EOF)rn k=0;end=0;start=1;rn while(n--)rn SUM=0;end=0;start=1;rn scanf("%d",&a[0]);rn for(i=1;i<=a[0];i++)rn rn scanf("%d",&a[i]);rn rn for(i=1;i<=a[0];i++)rn rn K=a[i];sum=0;rn if(K>=0) end++;rn if(a[i]<0)rn rn int t=0;rn sum=a[i];rn for(j=i+1;sum<=0&&j<=a[0];j++)rn rn sum=sum+a[j];t++;rn rn if(sum<=0) sum=0;K=0;flag=-t-1;rn i=j-1;rn K=0;rn end=i+flag;rn flag=0;rn rn SUM=SUM+sum+K;rn rn T=0;rn for(J=a[0];J>=0;J--)rn rn if(a[J]==0) T++;rn else break;rn rn if(T==a[0]-J) end=end-T;rn k++;rn printf("Case %d:\n",k);rn if(a[1]==0&&SUM==0) end=1;start=1;rn if(SUM==0&&sum==0) end=0;start=0;rn printf("%d %d %d\n\n",SUM,start,end);rn rn rn return 0;rnrn[/code]

没有更多推荐了,返回首页

私密
私密原因:
请选择设置私密原因
  • 广告
  • 抄袭
  • 版权
  • 政治
  • 色情
  • 无意义
  • 其他
其他原因:
120
出错啦
系统繁忙,请稍后再试