Given a sequence of K K K integers { N 1 N_1 N1, N 2 N_2 N2,… N k N_k Nk}. A continuous subsequence is defined to be { N i N_i Ni, N i + 1 N_{i+1} Ni+1,… N j N_j Nj}where 1 ≤ i ≤ j ≤ K 1≤i≤j≤K 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { − 2 , 11 , − 4 , 13 , − 5 , − 2 -2, 11, -4, 13, -5, -2 −2,11,−4,13,−5,−2 }, its maximum subsequence is { 11 , − 4 , 13 11, -4, 13 11,−4,13 } with the largest sum being 20 20 20.
Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.
Input Specification:
Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K K K ( ≤ 10000 ≤10000 ≤10000). The second line contains K K K numbers, separated by a space.
Output Specification:
For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the
K
K
K numbers are negative, then its maximum sum is defined to be
0
0
0, and you are supposed to output the first and the last numbers of the whole sequence.
Sample Input:
10
-10 1 2 3 4 -5 -23 3 7 -21
Sample Output:
10 1 4
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 10;
int a[maxn];
int n;
bool flag0,flag1;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] == 0) flag0 = true;
if (a[i] > 0) flag1 = true;
}
if (!flag1 && !flag0) {
printf("0 %d %d\n", a[1], a[n]);
return 0;
}
if (!flag1 && flag0) {
printf("0 0 0\n");
return 0;
}
int sum = 0, mx = -1, pos = 0;
for (int i = 1; i <= n; i++) {
if (sum + a[i] < 0) sum = max(a[i], 0);
else sum += a[i];
if (sum > mx) {
mx = sum;
pos = i;
}
}
int ans = mx, posr = pos;
while (pos >= 1) {
mx -= a[pos];
pos--;
if (mx == 0) break;
}
printf("%d %d %d\n", ans, a[pos + 1], a[posr]);
return 0;
}