突然发现还没有写过openjudge的题解 安排~
题目
描述
Given a set of n integers: A={a1, a2,…, an}, we define a function d(A) as below:
t1 t2 d(A) = max{ ∑ai + ∑aj | 1 <= s1 <= t1 < s2 <= t2 <= n } i=s1 j=s2
Your task is to calculate d(A).
输入
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.
输出
Print exactly one line for each test case. The line should contain the integer d(A).
样例输入
1
10
1 -1 2 2 3 -3 4 -4 5 -5
样例输出
13
提示
In the sample, we choose {2,2,3,-3,4} and {5}, then we can get the answer.
Huge input,scanf is recommended.
看不懂英文的翻译给你们安排上了~
描述
给定一组n个整数:a={a1,a2,…,an},我们将函数d(a)定义如下:
t1和t2
d(A) = max{ ∑ai + ∑aj | 1 <= s1 <= t1 < s2 <= t2 <= n }
i=s1 j=s2
你的任务是计算d(A)。
输入
输入由T(<=30)个测试用例组成。测试用例数(T)在输入的第一行给出。
每个测试用例包含两行代码。第一行是整数n(2<=n<=50000)。第二行包含n个整数:a1,a2,…,an。(| ai |<=10000)。每个案例后面都有一个空行。
输出
为每个测试用例只打印一行。该行应包含整数d(A)。
样例输入
1
10
1 -1 2 2 3 -3 4 -4 5 -5
样例输出
13
提示
在示例中,我们选择{2,2,3,-3,4}和{5},然后我们可以得到答案。
投入巨大,建议scanf。
上代码
#include<bits/stdc++.h>
using namespace std;
#