C语言动态规划(2)___Maximum sum

最新推荐文章于 2022-01-12 01:43:33 发布

YzlCoder

最新推荐文章于 2022-01-12 01:43:33 发布

阅读量1.2k

点赞数 3

分类专栏： ACM_日常

本文链接：https://blog.csdn.net/y1196645376/article/details/41048733

版权

ACM_日常专栏收录该内容

131 篇文章 2 订阅

订阅专栏

Description

Given a set of n integers: A={a1, a2,..., an}, we define a function d(A) as below:

Your task is to calculate d(A).

Input

The input consists of T(<=30) test cases. The number of test cases (T) is given in the first line of the input.
Each test case contains two lines. The first line is an integer n(2<=n<=50000). The second line contains n integers: a1, a2, ..., an. (|ai| <= 10000).There is an empty line after each case.

Output

Print exactly one line for each test case. The line should contain the integer d(A).

Sample Input

1

10
1 -1 2 2 3 -3 4 -4 5 -5

Sample Output

Hint

In the sample, we choose {2,2,3,-3,4} and {5}, then we can get the answer.

Huge input,scanf is recommended.

样例：

#include <stdio.h>
#define max(A,B) ((A) >= (B) ? (A) : (B))
int main()
{
	int a[50010],b[50010],c[50010],d[50010],i,n,j,k,N; //a数组放数列.

//b[i]前i个数中最大的子序列和.d[i]表示后i个数中最大的子序列和
	scanf("%d",&N);
	while(N--)
	{
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			if(i==0)
				k=c[0]=b[0]=a[0];
			else
			{
				c[i]=max(c[i-1]+a[i],a[i]); //动态规划
				k=b[i]=max(c[i],k);
			}
		}
		for(i=n-1;i>=0;i--)
		{
			if(i==n-1)
				k=d[i]=c[i]=a[i];
			else
			{
				c[i]=max(c[i+1]+a[i],a[i]);  //动态规划
				k=d[i]=max(c[i],k);
			}
		}
		k=-99999;
		for(i=0;i<n-1;i++)
		{
			a[i]=b[i]+d[i+1];
			k=max(a[i],k);
		}
		printf("%d\n",k);
	}
	return 0;
}

简单的一道动态规划题时间复杂度为O(N)