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

using namespace std;

typedef long long ll;

int A[100010];
vector<ll> D;

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

    int n;
    cin >> n;
    ll s = 0;
    for (int i = 1; i <= n; i++) {
        cin >> A[i];
        s += A[i];
    }
    for (int i = n; i >= 1; i--) {
        if (s % i != 0) continue;
        D.clear();
        D.resize(n + 2);
        ll ta = 0;
        int ok = 1;
        for (int j = 1; j <= n + 1; j++) {
            ta -= D[j];
            if (j + i <= n + 1 && A[j] > ta) {
                D[j + i] = A[j] - ta;
                ta = A[j];
            }
            if (A[j] != ta) {
                ok = 0;
                break;
            }
        }
        if (ta == 0 && ok) {
            cout << i << "\n";
            cout.flush();
            return 0;
        }
    }

    return 0;
}