poj2479Maximum sum【dp】

最新推荐文章于 2020-12-21 18:31:56 发布

坚定的水手

最新推荐文章于 2020-12-21 18:31:56 发布

阅读量250

点赞数

本文链接：https://blog.csdn.net/liu6886/article/details/49892879

版权

Maximum sum

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 37038		Accepted: 11555

Description

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

$d(A)=\max_{1\leq s_1\leq t_1<s_2\leq t_2\leq n}\left\{\sum_{i=s_1}^{t_1}a_i+\sum_{j=s_2}^{t_2}a_j\right\}$

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.

跟poj2593一样~

#include<cstring>
#include<cstdio>
const int M=5e4+10;
int a[M], b[M], c[M];
int main(){
	
	int t;
	scanf("%d", &t);
	while(t--)
	{
		int i,j,k,m,n;
		scanf("%d", &n);
		k = 0;
		m = -10001;
		for(i = 0; i < n; i++)
		{
			scanf("%d", &a[i]);
			k += a[i];
			if(k > m)
				m = k;
			if(k < 0)
				k = 0;
			b[i] = m;		
		}
		k = 0;
		m = -10001;
		for(i = n-1; i>=0; i--)
		{
			k+=a[i];
			if(k > m)
				m = k;
			if(k < 0)
				k = 0;
			c[i] = m;		
		}
		int mx = b[0]+c[1];
		for(i = 0; i<n-1;i++)
		{
			if(mx < b[i]+c[i+1])
				mx = b[i]+c[i+1];
		}
		printf("%d\n", mx);
	}
}