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
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

bool solve(int n, const vector<int> &a, int k)
{
    vector<long long> d(2 * n + 1, 0);
    long long current = 0;

    for (int i = 0; i < n; ++i)
    {
        current += d[i];

        if (current > a[i])
        {
            return false;
        }

        long long used = max(0LL, (long long)a[i] - current);

        if (i >= n - k + 1 && used > 0)
        {
            return false;
        }

        if (i + 1 < d.size())
            d[i + 1] += used;
        if (i + k < d.size())
            d[i + k] -= used;
    }

    return true;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    cin >> n;

    vector<int> a(n);
    long long sum = 0;

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

    for (int k = n; k >= 1; --k)
    {
        if (sum % k != 0)
        {
            continue;
        }
        if (solve(n, a, k))
        {
            cout << k << endl;
            break;
        }
    }

    return 0;
}