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
#include <cstdio>
#include <cassert>

int A[100000], C[100001];

int main(void) {
  int n;
  scanf("%d", &n);
  long long s = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", &A[i]);
    s += A[i];
  }
  int r;
  for (r = n; r > 1; r--) {
    if (s%r > 0) continue;
    for (int i = 0; i < n+1; i++) C[i] = 0;
    int l = 0;
    for (int i = 0; i < n; i++) {
      if (l < 0) goto next;
      if (A[i] < l) goto next;
      if (A[i] > l && i+r-1 > n) goto next;
      if (i+r-1 <= n) C[i+r-1] = A[i]-l;
      l = A[i] - C[i];
    }
    if (l > 0) goto next;
    break;
    next:;
  }
  printf("%d\n", r);
}