1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include <bits/stdc++.h>

#define pb push_back

using namespace std;

typedef long long ll;
typedef vector<ll> vll;


bool solve(vll &v, ll len)
{
    if (v.size() < len) return false;

    vll cost(v.size()+1, 0);

    ll currentCost = 0;
    for (int i = 0; i < v.size(); ++i) {
        currentCost += cost[i];
        if (v[i] + currentCost > 0) {
            if (i + len > v.size()) return false;
            else {
                cost[i] -= (v[i] + currentCost);
                cost[i+len] += (v[i] + currentCost);
                currentCost -= (v[i] + currentCost);
            }
        }
        if (v[i] + currentCost < 0) return false;
    }

    return true;
}

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

    ll n;
    cin >> n;

    vll v(n);
    ll sum = 0;

    for (int i = 0; i < n; ++i) {
        cin >> v[i];
        sum += v[i];
    }

    ll result = 1;
    for (int i = 1; i*i <= sum && i <= n; ++i) {
        if (sum % i == 0) {
            if (solve(v, i)) {
                if (i > result) result = i;
            }
             if (solve(v, sum/i)) {
                if (sum/i > result) result = sum/i;
            }
        }
    }

    cout << result << endl;
}