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
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
using namespace std;
#define ll long long
int tab[1'000'000];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(nullptr);

    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> tab[i];
    }
    for (int f = n; f >=1; f--)
    {
        int b = 1;
        vector<int>v(n+2);
        for (int i = 1; i <= n; i++)
        {
            if (n - i - f+1 < 0)
                break;
            if (v[i] > tab[i])
            {
                b = 0;
                break;
               
            }
            int dod = (tab[i]-v[i]);
            for (int j = 0; j < f; j++)
            {
                 v[j + i] += dod;
            }
            
        }
        //cout <<f<< " | ";
        if(b==1)
            for (int i = 1; i <= n; i++)
            {
                //cout << v[i] << " ";
                if (v[i] != tab[i])
                 b=0;
          }
        //cout << endl;
        if (b)
        {
            cout << f;
            return 0;
        }
       // cout << endl;
    }

}