PAT -1007

最新推荐文章于 2025-01-21 14:18:02 发布

ch209209

最新推荐文章于 2025-01-21 14:18:02 发布

阅读量600

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT Algorithm c/c++

本文链接：https://blog.youkuaiyun.com/ch209209/article/details/8193645

Algorithm 同时被 3 个专栏收录

10 篇文章

订阅专栏

c/c++

9 篇文章

订阅专栏

PAT

6 篇文章

订阅专栏

1007. Maximum Subsequence Sum

题目地址：http://pat.zju.edu.cn/contests/pat-practise/1007

Given a sequence of K integers { N₁, N₂, ..., N_K }. A continuous subsequence is defined to be { N_i, N_i+1, ..., N_j } where 1 <= i <= j <= K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.

Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.

Input Specification:

Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K (<= 10000). The second line contains K numbers, separated by a space.

Output Specification:

For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.

Sample Input:

10
-10 1 2 3 4 -5 -23 3 7 -21

Sample Output:

10 1 4

#if 1

#include <stdio.h>

#define MAXN  (100000+1)

int FindMaxSubsequence(int a[],int n,int *l,int *r)
{
	int CurSum,MaxSum;
	int i,tempL;

	*l = 0;
	*r = 0;
	tempL = 0;
	CurSum = a[0];
	MaxSum = a[0];
	for(i = 1;i < n;i++)
	{
		if(CurSum < 0)
		{
			tempL = i;
			CurSum = 0;
		}

		CurSum += a[i];

		if(MaxSum < CurSum)
		{
			MaxSum = CurSum;
			*r = i;
			*l = tempL;
		}
	}
	return MaxSum;
}


int a[MAXN];
int main(int argc,char *argv[])
{
	int n;
	int i;
	int NegCnt;
	int l,r,MaxSum;
	
	freopen( "D:\\Chengsq\\in.txt" , "r" ,stdin);
    freopen( "D:\\Chengsq\\out.txt", "w" ,stdout);
	
	while(scanf("%d",&n) != EOF)
	{
		NegCnt = 0;
		for(i = 0;i < n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i] < 0)
				NegCnt++;
		}

		if(NegCnt == n)
		{
			MaxSum = 0;
			l= 0;
			r = n-1;
		}
		else
			{
				MaxSum = FindMaxSubsequence(a,n,&l,&r);
			}

	 printf("%d %d %d\n",MaxSum,a[l],a[r]);
	}
	
	return 0;
}


#endif