#include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
int n , a[N];
string s;
struct Node{
int L , R , cnt , ans;
Node operator+(Node y){
Node ret;
ret.cnt = cnt + y.cnt;
ret.L = max(L , cnt + y.L);
ret.R = max(y.R , y.cnt + R);
ret.ans = max({L + y.R , cnt + y.ans , ans + y.cnt});
return ret;
}
}T[4*N];
void B(int l = 0 , int r= n - 1 , int pos= 0){
if(l == r){
if(a[l] == 1) T[pos] = {1 , 1 , 1 , 1};
else T[pos] = {0 , 0 , -1 , 0};
return;
}
int mid = (l + r) >> 1;
B(l , mid , pos * 2 + 1);
B(mid + 1 , r , pos * 2 + 2);
T[pos] = T[pos * 2 + 1] + T[pos * 2 + 2];
}
Node get(int L , int R , int l =0 , int r= n - 1 ,int pos = 0){
if(r <L || R < l) return {0 , 0 ,0 , 0};
if(L <= l && r <= R) return T[pos];
int mid = (l + r) >> 1;
return get(L , R , l , mid , pos * 2 + 1) + get(L , R , mid + 1 , r ,pos * 2 + 2);
}
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> s;
for(int i = 0; i < n; ++i){
if(s[i] == 'T') a[i] = 1;
else a[i] = -1;
}
B();
int q;
cin >> q;
while(q--){
int a, b;
cin >> a >> b;--a; --b;
cout << get(a , b).ans << endl;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
332 KB |
Output is correct |
2 |
Correct |
5 ms |
336 KB |
Output is correct |
3 |
Correct |
5 ms |
332 KB |
Output is correct |
4 |
Correct |
6 ms |
332 KB |
Output is correct |
5 |
Correct |
5 ms |
336 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
332 KB |
Output is correct |
2 |
Correct |
5 ms |
336 KB |
Output is correct |
3 |
Correct |
5 ms |
332 KB |
Output is correct |
4 |
Correct |
6 ms |
332 KB |
Output is correct |
5 |
Correct |
5 ms |
336 KB |
Output is correct |
6 |
Correct |
178 ms |
6056 KB |
Output is correct |
7 |
Correct |
172 ms |
5956 KB |
Output is correct |
8 |
Correct |
170 ms |
5916 KB |
Output is correct |
9 |
Correct |
162 ms |
6088 KB |
Output is correct |
10 |
Correct |
166 ms |
6176 KB |
Output is correct |
11 |
Correct |
170 ms |
6036 KB |
Output is correct |
12 |
Correct |
184 ms |
6092 KB |
Output is correct |
13 |
Correct |
174 ms |
6084 KB |
Output is correct |
14 |
Correct |
209 ms |
6096 KB |
Output is correct |
15 |
Correct |
173 ms |
6024 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
332 KB |
Output is correct |
2 |
Correct |
5 ms |
336 KB |
Output is correct |
3 |
Correct |
5 ms |
332 KB |
Output is correct |
4 |
Correct |
6 ms |
332 KB |
Output is correct |
5 |
Correct |
5 ms |
336 KB |
Output is correct |
6 |
Correct |
178 ms |
6056 KB |
Output is correct |
7 |
Correct |
172 ms |
5956 KB |
Output is correct |
8 |
Correct |
170 ms |
5916 KB |
Output is correct |
9 |
Correct |
162 ms |
6088 KB |
Output is correct |
10 |
Correct |
166 ms |
6176 KB |
Output is correct |
11 |
Correct |
170 ms |
6036 KB |
Output is correct |
12 |
Correct |
184 ms |
6092 KB |
Output is correct |
13 |
Correct |
174 ms |
6084 KB |
Output is correct |
14 |
Correct |
209 ms |
6096 KB |
Output is correct |
15 |
Correct |
173 ms |
6024 KB |
Output is correct |
16 |
Correct |
1362 ms |
28896 KB |
Output is correct |
17 |
Correct |
1328 ms |
28500 KB |
Output is correct |
18 |
Correct |
1338 ms |
28792 KB |
Output is correct |
19 |
Correct |
1272 ms |
28272 KB |
Output is correct |
20 |
Correct |
1388 ms |
27984 KB |
Output is correct |
21 |
Correct |
1379 ms |
29776 KB |
Output is correct |
22 |
Correct |
1407 ms |
29724 KB |
Output is correct |
23 |
Correct |
1454 ms |
29908 KB |
Output is correct |
24 |
Correct |
1408 ms |
29672 KB |
Output is correct |
25 |
Correct |
1410 ms |
29140 KB |
Output is correct |