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
81
82
83
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;

#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define st first
#define nd second
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define debug false

const int MAXN = 100 * 1000 + 17;
int a[MAXN];
int akt[MAXN];
int n;
vector<int> v;

bool ok (int k) {
    for (int i = 0; i < n; i ++) {
        akt[i] = 0;
    }
    int cnt = 0;
    for (int i = 0; i < n; i ++) {
        cnt -= akt[i];
        if (cnt > a[i]) {
            return false;
        }
        int x = (a[i] - cnt);
        if (x > 0) {
            cnt += x;
            if (i + k > n) {
                return false;
            }
            akt[i + k] = x;
        }
    }
    return true;
}

int main () {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n;

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

    ll s = 0;
    for (int i = 0; i < n; i ++) {
        s += ll(a[i]);
    }

    for (int i = 1; i <= sqrt(s); i ++) {
        if (s % ll(i) == 0) {
            if (i <= n) {
                v.pb(i);
            }
            if (s/ll(i) <= n) {
                v.pb(s/ll(i));
            }
        }
    }

    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());

    for (auto x : v) {
        if (ok(x)) {
            cout << x << "\n";
            return 0;
        }
    }

    return 0;
}