CF 33C. Wonderful Randomized Sum【贪心】

C. Wonderful Randomized Sum
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Learn, learn and learn again — Valera has to do this every day. He is studying at mathematical school, where math is the main discipline. The mathematics teacher loves her discipline very much and tries to cultivate this love in children. That’s why she always gives her students large and difficult homework. Despite that Valera is one of the best students, he failed to manage with the new homework. That’s why he asks for your help. He has the following task. A sequence of n numbers is given. A prefix of a sequence is the part of the sequence (possibly empty), taken from the start of the sequence. A suffix of a sequence is the part of the sequence (possibly empty), taken from the end of the sequence. It is allowed to sequentially make two operations with the sequence. The first operation is to take some prefix of the sequence and multiply all numbers in this prefix by  - 1. The second operation is to take some suffix and multiply all numbers in it by  - 1. The chosen prefix and suffix may intersect. What is the maximum total sum of the sequence that can be obtained by applying the described operations?

Input
The first line contains integer n (1 ≤ n ≤ 105) — amount of elements in the sequence. The second line contains n integers ai ( - 104 ≤ ai ≤ 104) — the sequence itself.

Output
The first and the only line of the output should contain the answer to the problem.

Examples
inputCopy
3
-1 -2 -3
output
6
inputCopy
5
-4 2 0 5 0
output
11
inputCopy
5
-1 10 -5 10 -2
output
18

题意：将一个前缀全部乘上-1，将一个后缀全部乘上-1，可以重合。

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <algorithm>
using namespace std;
#define ll long long int
const int maxn = 1e5 + 10;
int a[maxn]; int n;
int pre[maxn], suf[maxn];//当前增益
int x[maxn], y[maxn];//最大增益
void init() {
    memset(a, 0, sizeof a); memset(pre, 0, sizeof pre);
    memset(pre, 0, sizeof pre); memset(suf, 0, sizeof suf);
    memset(x, 0, sizeof x); memset(y, 0, sizeof y);
}
int main()
{
    init();
    scanf("%d", &n); int sum = 0, tmp = 0;
    for (int i = 1; i <= n; i++) { scanf("%d", &a[i]); sum += a[i]; }
    for (int i = 1; i <= n; i++) {
        pre[i] = pre[i - 1] + (-2)*a[i];;
        x[i] = max(x[i-1], pre[i]);
    }
    for (int i = n; i >=1; i--) {
        suf[i] = suf[i + 1] + (-2)*a[i];
        y[i] = max(y[i + 1], suf[i]);
    }
    int ans = 0;
    for (int i = 1; i <= n+1; i++) {
        ans = max(ans, x[i - 1] + y[i]);
    }
    printf("%d\n", ans+sum);
    return 0;
}