Competitive_coding/HMAPPY1.cpp at master · shashank3395/Competitive_coding · 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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
#include<bits/stdc++.h>

using namespace std;

int main()
{


    int i,n,q,k;
    cin>>n>>q>>k;
    int a[4*n];
    int count1=0;
    for(i=0;i<n;i++)
    {
        cin>>a[i];
        if(a[i]==1)
            count1++;
    }
    for(;i<4*n;i++)
    {
        a[i]=a[i%n];
    }
    string str;
    cin>>str;
    if(count1==n)
    {
        for(int i=0;i<q;i++)
        {
            if(str[i]=='?')
            {
                cout<<k<<"\n";
            }
        }
    }
    else if(count1==0)
    {
        for(int i=0;i<q;i++)
        {
            if(str[i]=='?')
            {
                cout<<0<<"\n";
            }
        }
    }
    else
    {


        int maxi=-1,maxj=-1;
        int maxlength=0;
        int current_length=0;
        int currenti=-1,currentj=-1;
        for(int i=0;i<2*n;i++)
        {
            if(a[i]==1&&currenti==-1)
            {
                currenti=i;
                currentj=i;
                current_length=currentj-currenti+1;

            }
            else if(a[i]==1&&currenti!=-1)
            {
                currentj++;
                current_length=currentj-currenti+1;
                if(maxlength<current_length)
                {
                   maxi=currenti;
                   maxj=currentj;
                   maxlength=maxj-maxi+1;
                }
            }
            else if(a[i]==0)
            {
                currenti=-1;
                currentj=-1;
                current_length=0;
            }

        }
        if(n<=currentj&&n>=currenti)
        {
        int max2i=-1,max2j=-1;
        int maxl2ength=0;
        int current_length=0;
        int currenti=-1,currentj=-1;
        for(int i=currentj%n+1;i<currenti;i++)
        {
            if(a[i]==1&&currenti==-1)
            {
                currenti=i;
                currentj=i;
                current_length=currentj-currenti+1;

            }
            else if(a[i]==1&&currenti!=-1)
            {
                currentj++;
                current_length=currentj-currenti+1;
                if(maxlength<current_length)
                {
                   maxi=currenti;
                   maxj=currentj;
                   maxlength=maxj-maxi+1;
                }
            }
            else if(a[i]==0)
            {
                currenti=-1;
                currentj=-1;
                current_length=0;
            }
        }


    }

}
}