7.26 D - Max Sum

最新推荐文章于 2023-01-14 21:25:06 发布

Neng_Miao

最新推荐文章于 2023-01-14 21:25:06 发布

阅读量452

点赞数

CC 4.0 BY-SA版权

分类专栏： DP

本文链接：https://blog.youkuaiyun.com/Seven_deadly_sins/article/details/76158101

DP 专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一个名为D-MaxSum的算法问题，该问题旨在从给定整数序列中找出具有最大和的子序列，并返回该子序列的最大和及其起始和结束位置。文章通过一个具体的示例进行说明，并提供了完整的输入输出样例及C语言实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

D - Max Sum

Given a sequence a11,a22,a33......ann, 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>
#include<string.h>
int a[120000];
int main()
{
	int T,t,k,s,i,j,m,n,max,f,sum;
	while(scanf("%d",&T)!=EOF)
	{
		f=1;
		
		while(T--)
		{

			scanf("%d",&n);
			for(i=1;i<=n;i++)
			{
				scanf("%d",&a[i]);
			}
			max=-1e9;
			s=t=k=1;
			sum=0;
			for(i=1;i<=n;i++)
			{
				sum=sum+a[i];
				
				if(max<sum)
				{
					max=sum;
					t=s;
					k=i;
				}
				if(sum<0)
				{
					sum=0;
					s=i+1;
				}
			}
		
			printf("Case %d:\n%d %d %d\n",f++,max,t,k);
			if(T>0)
				printf("\n");
			
		}
	
	}
	return 0;
}