max sum(子列之和最大)

最新推荐文章于 2022-07-07 15:06:40 发布

yumy_buie

最新推荐文章于 2022-07-07 15:06:40 发布

阅读量372

点赞数 1

分类专栏： C语言文章标签： HDOJ

C语言专栏收录该内容

6 篇文章

订阅专栏

本文详细解析了子列最大和算法，通过实例说明如何在给定序列中找到具有最大和的子序列，并提供了一段C语言实现代码，用于计算序列的最大子列和及其起始和结束位置。

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

max sum(子列之和最大)
#HDOJ
原题
 参考代码

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 end,begin,temp,max;    

   int e,f,k=0,flag=1;  
   int a[100005],n,m,i; //数组接收数据，次数，个数，下标变量 
   				   		//初始化
   scanf("%d",&n);   	//输入次数
   while(n--)
   { 
   	begin=end=0;
   	k++;    			//case次数
   	
   	scanf("%d",&m);     //输入数据
    for(i=1;i<=m;i++)
		scanf("%d",&a[i]);

	temp=0;             // 和初始化
	max=-999999; 		//存放最小值
	begin=e=1;          //标记输入数据后，begin，e变化
	f=1;                //初始化

	for(i=1;i<=m;i++)
	{
		temp +=a[i];
		if(temp>max)    //大于最小值，把变量赋值给全新的变量，最后输出时不会出问题
		{
			e=begin;    
			f=i;
			max=temp;
		}

		if(temp<0)		//本人有考虑到
		{
 			begin = i+1; //当和小于0时，跳过，归零重新计算
 			temp = 0; 
		}
	}

	printf("Case %d:\n",k);	
	printf("%d %d %d\n",max,e,f);
	if(n!=0) printf("\n"); //不是最后一个 就输出换行符
   }

}

这个是参考另一个博主不是自己写的！！！！