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
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n=0,ans=0; vector<int> A;
bool F(int x)
{
    int spr=0; vector<int> ANS,B=A;  ANS.clear(); ANS.assign(n+12,0);
    for(int i=0; i<=n-x; ++i)
    {
        spr+=ANS[i]; B[i]-=spr;
        if(B[i]<0) return 0;
        else if(B[i]==0) continue;
        else{spr+=B[i]; if(i+x<n)ANS[i+x]-=B[i];}
    }
    for(int i=n-x+1; i<n; ++i)
    {
        spr+=ANS[i]; B[i]-=spr;
        if(B[i]!=0) return 0;
    }
    return 1;
}
void solve()
{
    cin>>n;
    for(int i=0; i<n; ++i){int KWA; cin>>KWA; A.push_back(KWA);}
    for(int jh=n; jh>=1; --jh){if(F(jh)){ans=jh;break;}}
    cout<<ans;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int MAKUMBA=1;
    //cin>>MAKUMBA;
    for(int KOKOJAMBO=0; KOKOJAMBO<MAKUMBA; ++KOKOJAMBO){solve();}
    return 0;
}