| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1288741 | Faisal_Saqib | Election (BOI18_election) | C++20 | 3 ms | 336 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N=5e5+10;
int pre[N];
int main()
{
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int n;
cin>>n;
string s;
cin>>s;
for(int i=0;i<n;i++)
{
pre[i+1]=pre[i]+((s[i]=='T')?1:-1);
// cout<<pre[i]<<' ';
}
// cout<<pre[n]<<endl;
int q;
cin>>q;
while(q--)
{
int l,r;
cin>>l>>r;
int mx=0;
for(int i=l;i<=r;i++)
{
// cout<<pre[i]-pre[l-1]<<' '<<pre[r]-pre[i-1]<<endl;
mx=max(mx,(pre[i]-pre[l-1]));
mx=max(mx,(pre[r]-pre[i-1]));
}
cout<<mx<<endl;
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
