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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include <bits/stdc++.h>
using namespace std;
#define fwd(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) fwd(i, 0, n)
#define all(X) X.begin(), X.end()
#define sz(X) int(size(X))
#define pb push_back
#define eb emplace_back
#define st first
#define nd second
using pii = pair<int, int>; using vi = vector<int>;
using ll = long long; using ld = long double;
#ifdef LOC
auto SS = signal(6, [](int) { *(int *)0 = 0; });
#define DTP(x, y) auto operator << (auto &o, auto a) -> decltype(y, o) { o << "("; x; return o << ")"; }
DTP(o << a.st << ", " << a.nd, a.nd);
DTP(for (auto i : a) o << i << ", ", all(a));
void dump(auto... x) { (( cerr << x << ", " ), ...) << '\n'; }
#define deb(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x)
#else
#define deb(...) 0
#endif

bool okay(vector<int>& V, int k) {
    int n = V.size() - 1;
    queue<pii> q;
    int cur = 0;
    for(int i = 1; i <= n; i++){
        if(!q.empty() && q.front().st == i) {
            cur -= q.front().nd;
            q.pop(); 
        }
        int p = V[i] - cur;
        if(p < 0) return false;
        if (p != 0) {
            cur += p;
            if(i + k - 1 > n) return false;
            q.push({i+k,p});
        }
    }
    return true;
}

void solve() {
    int n;
    cin >> n;
    vector<int> A(n+1);
    ll sum = 0;
    ll big = 0;
    for(int i = 1; i <= n; i++) {
        cin >> A[i];
        sum += A[i];
        big = max(big, (ll)A[i]);
    }

    // It divides sum but also cannot be > sum/big
    vector<ll> divs;
    for(ll i = 1; i * i <= sum; i++) {
        if (sum % i == 0 && i <= sum/big) {
            divs.pb(i);
            if(i * i != sum && sum/i <= sum/big)
                divs.pb(sum/i);
        }
    }
    sort(all(divs));
    reverse(all(divs));
    for(auto d: divs) {
        if(okay(A, d)) {
            cout << d << "\n";
            return;
        }
    }
}

int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	cout << fixed << setprecision(10);

    solve();
}