#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
int I = 0;
int J = 0;
int O = 0;
typedef pair<int,int> ii;
map<ii,int> m;
for(int i = 0;i < n;i++){
if(s[i] == 'I') I++;
else if(s[i] == 'O') O++;
else J++;
m[ii(O-J,O-I)] = i;
}
I = 0, J = 0, O = 0;
int ans = 0;
for(int i = 0;i < n;i++){
if(m.find(ii(O-J,O-I)) != m.end() && m[ii(O-J,O-I)] > i)
ans = max(ans,m[ii(O-J,O-I)] - i + 1);
if(s[i] == 'I') I++;
else if(s[i] == 'O') O++;
else J++;
}
cout << ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
2 ms |
376 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Correct |
2 ms |
376 KB |
Output is correct |
13 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
3 ms |
376 KB |
Output is correct |
3 |
Correct |
3 ms |
376 KB |
Output is correct |
4 |
Correct |
3 ms |
376 KB |
Output is correct |
5 |
Correct |
3 ms |
504 KB |
Output is correct |
6 |
Correct |
3 ms |
424 KB |
Output is correct |
7 |
Correct |
3 ms |
376 KB |
Output is correct |
8 |
Correct |
4 ms |
376 KB |
Output is correct |
9 |
Correct |
3 ms |
504 KB |
Output is correct |
10 |
Correct |
3 ms |
504 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
504 KB |
Output is correct |
2 |
Correct |
12 ms |
1016 KB |
Output is correct |
3 |
Correct |
20 ms |
1528 KB |
Output is correct |
4 |
Correct |
37 ms |
2296 KB |
Output is correct |
5 |
Correct |
61 ms |
3588 KB |
Output is correct |
6 |
Correct |
76 ms |
3588 KB |
Output is correct |
7 |
Correct |
75 ms |
4228 KB |
Output is correct |
8 |
Correct |
74 ms |
3588 KB |
Output is correct |
9 |
Correct |
74 ms |
3844 KB |
Output is correct |
10 |
Correct |
73 ms |
3588 KB |
Output is correct |
11 |
Correct |
60 ms |
5252 KB |
Output is correct |
12 |
Correct |
50 ms |
2308 KB |
Output is correct |
13 |
Correct |
36 ms |
1668 KB |
Output is correct |
14 |
Correct |
64 ms |
6272 KB |
Output is correct |
15 |
Correct |
33 ms |
1412 KB |
Output is correct |