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 <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
int n, q, arr[N], arr2[N], l, r, sum;
char c;
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
cin >> n;
for(int i = 1; i <= n; i++){
cin >> c;
arr[i] = (c == 'C' ? 1 : -1);
}
cin >> q;
while(q--){
cin >> l >> r;
copy(arr + l, arr + r + 1, arr2 + l);
sum = 0;
for(int i = l; i <= r; i++){
if(sum + arr2[i] < 0) arr2[i] = 0;
sum += arr2[i];
}
sum = 0;
for(int i = r; i >= 1; i--){
if(sum + arr2[i] < 0) arr2[i] = 0;
sum += arr2[i];
}
cout << count(arr2 + l, arr2 + r + 1, 0) << "\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |