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
84
85
86
87
88
89
90
91
92
#include <bits/stdc++.h>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<vi> vvi;
typedef vector<bool> vb;

#define eb(x) emplace_back(x)
#define loop(i,a,b) for (int (i) = (a); (i) < b; (i)++)
#define rloop(i,a,b) for (int (i) = (a); (i) >= b; (i)--)

int n;
vi w;

bool check(int x)
{
    vi ilKon(n+1);
    int ob = 0;

    loop(i, 0, n)
    {
        ob -= ilKon[i];

        if (ob < w[i])
        {
            if (i + x <= n)
            {
                int dod = w[i] - ob;
                ob += dod;
                ilKon[i + x] += dod;
            }
            else
                return false;
        }
        else if (ob > w[i])
            return false;
    }

    return true;
}

int main()
{
    cin.tie(0)->sync_with_stdio(false);
    
    cin >> n;
    w.resize(n);

    ll suma = 0ll;

    loop(i, 0, n) 
    {
        cin >> w[i]; suma += w[i];
    }
    
    int kon = min(n,(int)sqrt(suma));
    vi dz1, dz2;
    for (ll dz = 1; dz <= kon; dz++)
    {
        if (!(suma % dz))
        {
            dz1.eb(dz);
            ll dz_ = suma / dz;
            if (dz_ != dz && dz_ <= n)
                dz2.eb(dz_);
        }
    }

    loop(i, 0, dz2.size())
    {
        if (check(dz2[i]))
        {
            cout << dz2[i];
            return 0;
        }
    }

    rloop(i, dz1.size() - 1, 0)
    {
        if (check(dz1[i]))
        {
            cout << dz1[i];
            return 0;
        }
    }
    return 0;
}