PKU ACM 2479-Maximum sum

一道动态规划的题

http://acm.pku.edu.cn/JudgeOnline/problem?id=2479

 

Maximum sum

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 17327		Accepted: 5239

Description

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

这里公式看不见，就是求数组A中两段子数组的和的最大值。

 

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.

解题报告：

求数组中子数组的最大和，在编程之美上有提到。但是这里要求的是两段子数组的和的最大值，遍历两次，第一次遍历的时候，求出每个数之前的数组中子数组的最大和，第二次遍历的时候，求出每个数之后的数组中子数组的最大和，与它之前的子数组的最大和相加，得到最后的最大值。第一次遍历从前往后，第二次遍历从后往前。

第一次遍历，记录

start[i]：a[i]前一定包含a[i]的子数组的最大和。

all[i]: a[i]前的子数组的最大和。

第二次遍历，直接计算nStart, nall, 最大值=nall+all[i-1]

复杂度分析，O(n)

#include <iostream> using namespace std; #define N -500000001 int returnmax(int a, int b) { return a>b? a: b; } int main() { int caseNum; cin >> caseNum; while(caseNum--) { int max=N; int n; cin >> n; int *a = new int[n]; int *start = new int[n]; int *all = new int[n]; int nstart; int nall; for(int i = 0; i < n; i++) { scanf("%d",&a[i]); if(i>0) { start[i]=returnmax(a[i],start[i-1]+a[i]); all[i]=returnmax(all[i-1],start[i]); } else { start[i]=a[i]; all[i]=a[i]; } } for(int i=n-1;i>0;i--) { if(i==n-1) { nstart=a[i]; nall=a[i]; max=returnmax(max,nall+all[i-1]); } else { nstart=returnmax(a[i],nstart+a[i]); nall=returnmax(nall, nstart); max=returnmax(max,nall+all[i-1]); } } printf("%d/n",max); delete [] a; delete [] start; delete [] all; } }