Submission #1249342

#TimeUsernameProblemLanguageResultExecution timeMemory
1249342sunnyrainydayJOIOJI (JOI14_joioji)C++20
95 / 100
31 ms6040 KiB
#include <bits/stdc++.h>
#define int long long

using namespace std;

int n;
string s;
map<pair<int, int>, int> m;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> s;
    s = "#" + s;
    
    int ans = 0;

    int d1 = 0, d2 = 0;

    for(int i = 1; i <= n; i++) {
        if(s[i] == 'J') {
            d1++;
            d2++;
        } else if(s[i] == 'O') {
            d1--;
        } else {
            d2--;
        }

        if(m.find({d1, d2}) != m.end()) {
            ans = max(ans, i - m[{d1, d2}]);
        } else {
            m[{d1, d2}] = i;
        }
    }

    cout << ans;

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...