快来分块 （模拟）

10.29

思路：
模拟题，拿两个指针向中间逼近，就是细节有点恼火，拍出好多错【汗
二分也OK，二分pos，二分ans，随便搞都能水过去。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define LL long long
#define N 100010
using namespace std;

int n;
LL a[N], lf = 0, rg = 0, mid = 0, ans = 0, cc;

inline LL read(){
    LL x = 0, f = 1; char ch = getchar();
    while(ch < '0' || ch > '9'){ if(ch == '-') f = -1; ch = getchar(); }
    while(ch >= '0' && ch <= '9'){ x = x * 10LL + ch - '0'; ch = getchar(); }
    return x * f;
}

int main(){
    freopen ("part.in", "r", stdin);
    freopen ("part.out", "w", stdout);
    scanf("%d", &n);
    for(register int i=1; i<=n; i++){
        a[i] = read();
        mid += a[i];
    }
    int l=1, r=n; lf = a[1]; rg = a[n]; mid -= (lf + rg); ans = max(lf, rg); ans = max(ans, mid);
    while (lf < mid || rg < mid){
        if(lf < mid && lf + a[l+1] <= rg + a[r-1]){
            l++; lf += a[l]; mid -= a[l]; 
            cc = max(mid, lf); cc = max(cc, rg);
            if(ans >= cc) ans = cc;
            else mid += a[l], lf = ans;
        }
        else if(rg < mid && lf + a[l+1] > rg + a[r-1]){
            r--; rg += a[r]; mid -= a[r];
            cc = max(mid, lf); cc = max(cc, rg);
            if(ans >= cc) ans = cc;
            else mid += a[r], rg = ans;
        }
        else break;
    }
    cout << ans << endl;
}