Usaco-Programs/Broken Necklace at master · Mitgorakh/Usaco-Programs · 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
/*
ID: gorakhm1
PROG: beads
LANG: C++
*/
#include <iostream>
#include <string>
#include <fstream>

using namespace std;

int main()
{
    ofstream fout("beads.out");
    ifstream fin("beads.in");
    int iii, jjj, kkk, n, maxi = 0, counter;
    std::string s;
    char ch;
    fin >> n >> s;

    ch = s[0];
    for(iii = 1; iii < n; iii++){
        if(ch == s[iii] || s[iii] == 'w')
            continue;

        else break;
    }

    if(iii == n){
        fout << n << endl;
    }


    else{

        for(iii = 0; iii < n; iii++){
            ch = s[iii];
            counter = 1;
            if(ch == 'w'){
                jjj = (iii + 1) % n;
                while(s[jjj] == 'w'){
                    jjj = (jjj + 1) % n;
                    counter++;
                }

                ch = s[jjj];
                jjj = (jjj + 1) % n;
                counter++;
            }

            else {
                jjj = (iii + 1) % n;
            }

            for(;  ; jjj = (jjj + 1) % n){
                if(ch == s[jjj] || s[jjj] == 'w'){
                    counter++;
                    continue;
                }

                else break;
            }

            jjj = (jjj - 1 + n) % n;

            kkk = (iii - 1 + n) % n;
            ch = s[kkk];
            counter++;
            if(ch == 'w'){
                kkk = (kkk - 1 + n) % n;
                while(s[kkk] == 'w'){
                    kkk = (kkk - 1 + n) % n;
                    counter++;
                }
                ch = s[kkk];
                kkk = (kkk - 1 + n) % n;
                counter++;

            }

            else{
                kkk = (kkk - 1 + n) % n;
            }

            for(       ; kkk != jjj ; kkk = (kkk - 1 + n) % n){
                if(ch == s[kkk] || s[kkk] == 'w'){
                    counter++;
                    continue;
                }

                else break;
            }

            if(counter > maxi)
                maxi = counter;

        }

        fout << maxi << endl;

    }


    return 0;
}