[poj]Maximum sum

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

13

Hint

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

Huge input,scanf is recommended.

Source

POJ Contest,Author:Mathematica@ZSU

之前才做过leetcode上的

Best Time to Buy and Sell Stock III

 

leetcode上还有一道题是求一个数组中的连续数字的最大和

Maximum Subarray

这里要把数组分成两段，求两段的连续数字的最大和

0-i这一段的与Maximum Subarray的方法相同，一维的dp就可以求出。

求i+1到n这一段的最大连续数字和有点绕弯。总不能考虑n2的复杂度。

于是，从右向左遍历数组，同时维护两个数组，r和haha。数组r用来记录从选取当前点开始到n的最大连续数字之和，数组haha用来记录从当前j开始向后的最大的连续子序列之和。

最终，求最大的l[i]+haha[i+1]即可。

#include<iostream>
using namespace std;
int* l;
int* r;
int* haha;
int* num;
int n;
int dp(){
	l[0] = num[0];
	for(int i=1;i<n;i++){
		l[i] = max(num[i],l[i-1]+num[i]);
	}
	r[n-1] = num[n-1];
	haha[n-1] = num[n-1];
	for(int i=n-2;i>=0;i--){
		r[i] = max(num[i],num[i]+r[i+1]);
		haha[i] = max(haha[i+1],r[i]);
	}
	int ma = -10000;
	for(int i=0;i<n-1;i++){
		ma = max(ma,l[i]+haha[i+1]);
	}
	return ma;
}
int main(){
	int caseNum;
	scanf("%d",&caseNum);
	while(caseNum--){
		scanf("%d",&n);
		num = new int[n];
		l = new int[n];
		r = new int[n];
		haha = new int[n];
		for(int i=0;i<n;i++)
			scanf("%d",&num[i]);
		cout<<dp()<<endl;
		delete[] l;
		delete[] r;
		delete[] haha;
	}
	return 0;
}

ac