codeforces-solutions/1141 B.cpp at master · mohsin-riad/codeforces-solutions · GitHub

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
59
60
61
/**
* Git >> Mohsin_Riad
**/
#include<bits/stdc++.h>
using namespace std;

#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define mx 1000
typedef long long ll;
typedef double dd;

int main()
{
    IOS
    ll n;
    cin>>n;

    ll a[n+5];
    ///vector<int> v;

    for(int i=0; i<n ;i++)
    {
        cin>>a[i];
        ///v.push_back(a[i]);
    }

    int max=0, temp=0;
    for(int i=0, j=0; i<n ;i++)
    {
        if(a[i] == 1)
        {
            temp++;
            if(i == n-1)
                if(a[j] == a[i])
                {
                    temp++;
                    while(a[j] == a[j+1])
                    {
                        temp++;
                        j++;
                    }
                }
            else
                if(a[i] == a[i+1])
                    temp++;
            if(max < temp)
                max = temp;
        }
        else
        {
            if(max < temp)
                max = temp;
            temp=0;
        }
        //cout<<temp<<"\t";
    }
    cout<<max<<endl;

    return (0);
}