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
#include <bits/stdc++.h>
using namespace std;
#define int long long

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

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

    int suma = 0;
    for (int i=0; i<n; i++)
        suma += a[i];

    vector<int> d;
    for (int i=1; i*i <= suma; i++)
        if (suma%i == 0)
        {
            if(i <= n)
                d.push_back(i);
            if(suma/i <= n)
                d.push_back(suma/i);
        }

    int wynik = 0;
    for (int k : d)
    {
        vector<int> kon(n+1, 0);
        int akt = 0;
        bool ok = 1;
        for (int i=0; i<n; i++)
        {
            akt += kon[i];

            if(akt > a[i])
            {
                ok = 0;
                break;
            }
            if(akt < a[i])
            {
                int roz = a[i]-akt;
                akt += roz;
                if(i+k <= n)
                    kon[i+k] -= roz;
                else
                    ok = 0;
            }
        }
        if(ok)
            wynik = max(wynik, k);
    }
    cout << wynik;
}