#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.sync_with_stdio(false);
cin.tie(0);
int n, q;
string s;
cin>>n;
cin>>s;
cin>>q;
for(int i = 0; i < q; i++){
int l, r;
cin>>l>>r;
int x = 0, meg = 0;
vector<bool> kell(n, false);
for(int j = l-1; j < r; j++){
if(s[j] == 'T' && x > 0){
x--;
kell[j] = true;
} else if(s[j] == 'C')
x++;
else
meg++;
}
x = 0;
int legk = 0;
for(int j = r-1; j >= l-1; j--){
if(s[j] == 'T' && kell[j])
x--;
else if(s[j] == 'C')
x++;
legk = min(legk, x);
}
cout<<meg-legk<<"\n";
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
364 KB |
Output is correct |
2 |
Correct |
7 ms |
364 KB |
Output is correct |
3 |
Correct |
6 ms |
364 KB |
Output is correct |
4 |
Correct |
6 ms |
364 KB |
Output is correct |
5 |
Correct |
12 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
364 KB |
Output is correct |
2 |
Correct |
7 ms |
364 KB |
Output is correct |
3 |
Correct |
6 ms |
364 KB |
Output is correct |
4 |
Correct |
6 ms |
364 KB |
Output is correct |
5 |
Correct |
12 ms |
364 KB |
Output is correct |
6 |
Execution timed out |
3078 ms |
876 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
364 KB |
Output is correct |
2 |
Correct |
7 ms |
364 KB |
Output is correct |
3 |
Correct |
6 ms |
364 KB |
Output is correct |
4 |
Correct |
6 ms |
364 KB |
Output is correct |
5 |
Correct |
12 ms |
364 KB |
Output is correct |
6 |
Execution timed out |
3078 ms |
876 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |