Submission #84505

#TimeUsernameProblemLanguageResultExecution timeMemory
84505PajarajaElection (BOI18_election)C++17
28 / 100
3044 ms2000 KiB
#include <bits/stdc++.h> #define MAXN 500007 using namespace std; string s; char c[MAXN]; int val[MAXN],sol[MAXN],a[MAXN]; int main() { int n,q; cin>>n>>s>>q; for(int i=0;i<q;i++) { int l,r; cin>>l>>r; int m=r-l+1,sum=0,t=0,mi=0; for(int i=l;i<=r;i++) a[i-l]=s[i-1]=='T'?-1:1; for(int i=0;i<m;i++) { sum+=a[i]; if(sum<0) {sum=0; a[i]=0; t++;} } sum=0; for(int i=m-1;i>=0;i--) { sum+=a[i]; mi=min(mi,sum); } cout<<t-mi<<endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...