This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
int n,x,y,z,res;
char str[200001];
map<ll,int> mp;
int main(){
scanf("%d %s", &n, str);
mp[0] = -1;
for (int i = 0; i < n; i++) {
if (str[i] == 'J') x++;
else if (str[i] == 'O') y++;
else z++;
if (x&&y&&z) x--, y--, z--;
ll h = ((ll)x*1000000 + y)*1000000 + z;
auto it = mp.find(h);
if (it == mp.end()) mp[h]=i;
else res = max(res,i - it->second);
}
printf("%d", res);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |