Codeforces Round #448 (Div. 2) A. Pizza Separation 前缀和

题意：

给定n个披萨块，分成两部分 分别连续的，使得两个部分角度和之差最小

思路：

明显的前缀和问题，枚举其中一部分的连续的长度，然后记录最小的差值可能

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 360 + 7, maxd = 670000 + 7;
const ll mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;


int n, ans = 999;
int a[maxn*2];
int sum[maxn*2] = {0};

int main() {
    ios::sync_with_stdio(0);

    cin >> n; int m = 2*n;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i];
        ans = min(ans, abs(180-a[i]));
        a[i+n] = a[i];
    }
    for(int i = 1; i < m; ++i) {
        sum[i] = sum[i-1] + a[i];
    }

    for(int len = 2; len <= n; ++len) {
        for(int i = 0; i+len < m; ++i) {
            ans = min(ans, abs(180 - (sum[i+len]-sum[i])));
        }
    }
    cout << ans*2 << endl;

    return 0;
}