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 <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
const int inf = 1'000'000'000;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
vi A(1+N);
for(int i = 1; i <= N; i++)
{
char c;
cin >> c;
if(c == 'T')
A[i] = +1;
else
A[i] = -1;
}
vi p(1+N);
p[0] = 0;
for(int i = 1; i <= N; i++)
p[i] = p[i-1] + A[i];
vi s(1+N);
s[N] = 0;
for(int i = N-1; i >= 0; i--)
s[i] = s[i+1] + A[i+1];
int Q;
cin >> Q;
for(int q = 1; q <= Q; q++)
{
int l, r;
cin >> l >> r;
int pmx = -inf;
for(int i = l-1; i <= r; i++)
{
pmx = max(pmx, p[i]);
}
int c1 = pmx - p[l-1];
// cerr << "c1 = " << c1 << '\n';
// cerr << "pmx = " << pmx << '\n';
int c2 = -inf;
int currpmax = -inf;
for(int i = l-1; i <= r; i++)
{
currpmax = max(currpmax, p[i]);
// cerr << i << " : " << s[i] - s[r] << " " << currpmax << '\n';
// cerr << "maximum occ = " << currpmax - pmx << '\n';
// c2 = min(c2, max(0, s[i] - s[r]) + currpmax - pmx);
if(s[i] > s[r])
{
// cerr << "! " << s[i]-s[r] << ' ' << (pmx - currpmax) << '\n';
c2 = max(c2, (s[i] - s[r]) - (pmx - currpmax));
}
}
cout << c1+c2 << '\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... |