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

using namespace std;

bool daSie (int dl, vector <int> &a) {
    vector <long long> ile(a.size()+2);
    long long curr = 0;
    for (int i = 0; i < a.size(); i++) {
        curr+=ile[i];
        long long wart=a[i]+curr;
        if (wart < 0 || (i+dl > a.size() && wart > 0)) return false;
        if (wart > 0) {
            curr-=wart;
            ile[i+dl]+=wart;
        }
    }
    return true;
}

int main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    vector <int> a(n);
    long long suma = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        suma+=a[i];
    }
    int wyn = 1;
    vector <int> mozl;
    for (long long i = 1; i*i <= suma; i++) {
        if (suma%i == 0) {
            if (i <= n) mozl.push_back(i);
            long long  j = suma/i;
            if (j != i && j <= n) mozl.push_back(j);
        }
    }
    sort(mozl.rbegin(), mozl.rend());
    for (auto k : mozl) {
        if (daSie(k, a)) {
            wyn = k;
            break;
        }
    }
    cout << wyn << "\n";
    return 0;
}