CodeForces - 846C Four Segments 暴力+枚举

输入是计算前缀和

直接枚举 x2 点，对于 x2 左右两边，分别枚举 x1 ， x3 点，记录最大值和 三个点

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <algorithm>
#include <sstream>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
using namespace std;
typedef long long ll;
const int maxn = 5000 + 7, INF = 0x3f3f3f3f, mod = 1e9 + 7;
int n;
ll a[maxn];

void init() {
    a[0] = 0;
    for(int i = 1; i <= n; ++i) {
        scanf("%lld", &a[i]);
        a[i] += a[i-1];
    }
}

void solve() {
    int x1, x2, x3;
    ll ans = -INF, num;
    for(int i = 1; i <= n+1; ++i) {
        num = 0;
        ll max_ = -INF;
        int t1 = 0, t2 = 0;
        for(int j = 1; j <= i; ++j) {
            ll t = a[j-1] - a[i-1] + a[j-1];
            if(t > max_) {
                max_ = t;
                t1 = j;
            }
        }
        num += max_;
        max_ = -INF;
        for(int j = i; j <= n+1; ++j) {
            ll t = a[j-1] - a[i-1] - a[n] + a[j-1];
            if(t > max_) {
                max_ = t;
                t2 = j;
            }
        }
        num += max_;
        if(num > ans) {
            ans = num;
            x1 = t1, x2 = i, x3 = t2;
            //cout << x1 << " = " << x2 << " = " << x3 << " = " << num << endl;
        }
    }
    cout << x1-1 << " " << x2-1 << " " << x3-1 << endl;
}

int main() {
    scanf("%d", &n);
    init();
    solve();
    return 0;
}