#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
//#pragma GCC optimize("Ofast") //#pragma GCC optimize "unroll-loops" //#pragma GCC target "avx,avx2,fma,abm,popcnt,tune=native" //#pragma GCC optimize "prefetch-loop-arrays"
using namespace std; using namespace __gnu_pbds;
#define foru(i,a,b) for(int i=(a);i<(b);i++)
#define ford(i,a,b) for(int i=(a)-1;i>=(b);i--)
#define fori(a,b) foru(i,a,b)
#define forj(a,b) foru(j,a,b)
#define fork(a,b) foru(k,a,b)
#define seto(x,i) memset(x,i,sizeof x)
#define pf first
#define ps second
#define pb push_back
#define eb emplace_back
#define em emplace
#define mp make_pair
#define mt make_tuple
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __builtin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define P2(x) (1LL<<(x))
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)
#define lwb lower_bound
#define upb upper_bound
#if __SIZEOF_INT128__
typedef __int128_t i128; typedef __uint128_t ui128;
#endif
typedef int64_t ll; typedef uint64_t ull; typedef long double lld; typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef pair<lld,lld> pdd;
template<class T1,class T2> using ordered_map=tree<T1,T2,less<T1>,rb_tree_tag,tree_order_statistics_node_update>; template<class T1> using ordered_set=ordered_map<T1,null_type>;
template<class T> using minpq=std::priority_queue<T,vector<T>,greater<T>>; template<class T> using maxpq=std::priority_queue<T,vector<T>,less<T>>;
template<class T> using minpairingheap=__gnu_pbds::priority_queue<T,greater<T>,pairing_heap_tag>; template<class T>using maxpairingheap=__gnu_pbds::priority_queue<T,less<T>,pairing_heap_tag>;
const int inf=0x3f3f3f3f,MOD=1e9+7; const ll INF=0x3f3f3f3f3f3f3f3f; const lld PI=acos((lld)-1);
const ll SEED=443214^chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count();
mt19937 randgen(SEED); ll rand(ll a, ll b){return uniform_int_distribution<ll>(a,b)(randgen);}
ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
ll fpow(ll a,ll b){ll ret=1;for(;b;b>>=1){if(b&1) ret=ret*a%MOD;a=a*a%MOD;}return ret;} ll fpow(ll a,ll b,ll M){ll ret=1;for(;b;b>>=1){if(b&1) ret=ret*a%M;a=a*a%M;}return ret;}
template<class T1,class T2>constexpr const auto _min(const T1&x,const T2&y){return x<y?x:y;} template<class T,class...Ts>constexpr auto _min(const T&x,const Ts&...xs){return _min(x,_min(xs...));}
template<class T1,class T2>constexpr const auto _max(const T1&x,const T2&y){return x>y?x:y;} template<class T,class...Ts>constexpr auto _max(const T&x,const Ts&...xs){return _max(x,_max(xs...));}
#define min(...) _min(__VA_ARGS__)
#define max(...) _max(__VA_ARGS__)
template<class T1,class T2>constexpr bool ckmin(T1&x,const T2&y){return x>y?x=y,1:0;} template<class T,class...Ts>constexpr bool ckmin(T&x,const Ts&...xs){return ckmin(x,min(xs...));}
template<class T1,class T2>constexpr bool ckmax(T1&x,const T2&y){return x<y?x=y,1:0;} template<class T,class...Ts>constexpr bool ckmax(T&x,const Ts&...xs){return ckmax(x,max(xs...));}
template<class T1,class T2,class T3,class T4> constexpr const auto operator+(const pair<T1,T2>& a,const pair<T3,T4>& b){return mp(a.pf+b.pf,a.ps+b.ps);}
template<class T1,class T2,class T3,class T4> constexpr const auto operator-(const pair<T1,T2>& a,const pair<T3,T4>& b){return mp(a.pf-b.pf,a.ps-b.ps);}
template<class T1,class T2,class T3> constexpr const auto operator *(const pair<T1,T2>& a,const T3& b){return mp(a.pf*b,a.ps*b);}
template<class T1,class T2,class T3> constexpr const auto operator *(const T1& a,const pair<T2,T3>& b){return b*a;}
template<class T1,class T2,class T3> constexpr const auto operator /(const pair<T1,T2>& a,const T3& b){return mp(a.pf/b,a.ps/b);}
template<class T1,class T2,class T3,class T4> constexpr const auto& operator+=(pair<T1,T2> &a,const pair<T3,T4> &b){return a=a+b;}
template<class T1,class T2,class T3,class T4> constexpr const auto& operator-=(pair<T1,T2> &a,const pair<T3,T4> &b){return a=a-b;}
template<class T1,class T2,class T3> constexpr const auto& operator*=(pair<T1,T2> &a,const T3 &b){return a=a*b;}
template<class T1,class T2,class T3> constexpr const auto& operator/=(pair<T1,T2> &a,const T3 &b){return a=a/b;}
template<class T,class U> void erase(T& t,const U& u){auto it=t.find(u);if(it!=end(t)) t.erase(it);}
struct chash{
static ll splitmix64(ll x){x+=0x9e3779b97f4a7c15; x=(x^(x>>30))*0xbf58476d1ce4e5b9; x=(x^(x>>27))*0x94d049bb133111eb; return x^(x>>31);}
template<class T> size_t operator()(const T &x) const{return splitmix64(hash<T>()(x)+SEED);}
template<class T1,class T2> size_t operator()(const pair<T1,T2>&x)const{return 31*operator()(x.first)+operator()(x.second);}};
void fIn(string s){freopen(s.c_str(),"r",stdin);} void fOut(string s){freopen(s.c_str(),"w",stdout);} void fIO(string s){fIn(s+".in"); fOut(s+".out");}
string to_string(char c){return string(1,c);} string to_string(char* s){return (string)s;} string to_string(string s){return s;}
template<class T> string to_string(complex<T> c){stringstream ss; ss<<c; return ss.str();}
template<class T1,class T2> string to_string(pair<T1,T2> p){return "("+to_string(p.pf)+","+to_string(p.ps)+")";}
template<class T> string to_string(T v){string ret="{"; for(const auto& x:v) ret+=to_string(x)+","; return ret+"}";}
void DBG(){cerr<<"]"<<endl;} template<class T,class... Ts> void DBG(T x,Ts... xs){cerr<<to_string(x); if(sizeof...(xs)) cerr<<", "; DBG(xs...);}
#ifdef LOCAL
#define dbg(...) cerr<<"Line("<< __LINE__<<") -> ["<<#__VA_ARGS__<<"]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
#define nl "\n"
const int N=P2(19),M=MOD;
struct segTree{ // 0 indexed, N must be power of 2
struct node{
int a,s,l,r;
} seg[2*N];;
node comb(node a,node b){
node ret;
ret.s=a.s+b.s;
ret.l=max(a.l,b.l+a.s);
ret.r=max(b.r,a.r+b.s);
ret.a=max(a.a+b.s,b.a+a.s,a.l+b.r);
return ret;
}
void pull(int x){
seg[x]=comb(seg[x*2],seg[x*2+1]);
}
void build(int *a){
fori(0,N) seg[i+N]={max(0,a[i]),a[i],a[i],a[i]};
ford(i,N,1) pull(i);
}
int query(int l,int r){
node ret1,ret2; ret1=ret2={0,0,0,0};
for(l+=N,r+=N+1;l<r;l/=2,r/=2){
if(l&1) ret1=comb(ret1,seg[l++]);
if(r&1) ret2=comb(seg[--r],ret2);
}
return comb(ret1,ret2).a;
}
} st;
int n,q,aa[N],a,b;
string s;
int main(){
cin.tie(0)->sync_with_stdio(0);
cin>>n>>s>>q;
fori(0,n) aa[i]=s[i]=='C'? -1:1;
st.build(aa);
fori(0,q){
cin>>a>>b; a--; b--;
cout<<st.query(a,b)<<nl;
}
return 0;
}
/**
wtf
this is :galaxybrain:
*/
Compilation message
election.cpp: In function 'void fIn(std::string)':
election.cpp:63:27: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
63 | void fIn(string s){freopen(s.c_str(),"r",stdin);} void fOut(string s){freopen(s.c_str(),"w",stdout);} void fIO(string s){fIn(s+".in"); fOut(s+".out");}
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
election.cpp: In function 'void fOut(std::string)':
election.cpp:63:78: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
63 | void fIn(string s){freopen(s.c_str(),"r",stdin);} void fOut(string s){freopen(s.c_str(),"w",stdout);} void fIO(string s){fIn(s+".in"); fOut(s+".out");}
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
16716 KB |
Output is correct |
| 2 |
Correct |
12 ms |
16716 KB |
Output is correct |
| 3 |
Correct |
12 ms |
16716 KB |
Output is correct |
| 4 |
Correct |
12 ms |
16716 KB |
Output is correct |
| 5 |
Correct |
13 ms |
16716 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
16716 KB |
Output is correct |
| 2 |
Correct |
12 ms |
16716 KB |
Output is correct |
| 3 |
Correct |
12 ms |
16716 KB |
Output is correct |
| 4 |
Correct |
12 ms |
16716 KB |
Output is correct |
| 5 |
Correct |
13 ms |
16716 KB |
Output is correct |
| 6 |
Correct |
46 ms |
18308 KB |
Output is correct |
| 7 |
Correct |
44 ms |
18236 KB |
Output is correct |
| 8 |
Correct |
46 ms |
18220 KB |
Output is correct |
| 9 |
Correct |
41 ms |
18308 KB |
Output is correct |
| 10 |
Correct |
45 ms |
18196 KB |
Output is correct |
| 11 |
Correct |
46 ms |
18372 KB |
Output is correct |
| 12 |
Correct |
45 ms |
18428 KB |
Output is correct |
| 13 |
Correct |
49 ms |
18420 KB |
Output is correct |
| 14 |
Correct |
48 ms |
18500 KB |
Output is correct |
| 15 |
Correct |
46 ms |
18340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
16716 KB |
Output is correct |
| 2 |
Correct |
12 ms |
16716 KB |
Output is correct |
| 3 |
Correct |
12 ms |
16716 KB |
Output is correct |
| 4 |
Correct |
12 ms |
16716 KB |
Output is correct |
| 5 |
Correct |
13 ms |
16716 KB |
Output is correct |
| 6 |
Correct |
46 ms |
18308 KB |
Output is correct |
| 7 |
Correct |
44 ms |
18236 KB |
Output is correct |
| 8 |
Correct |
46 ms |
18220 KB |
Output is correct |
| 9 |
Correct |
41 ms |
18308 KB |
Output is correct |
| 10 |
Correct |
45 ms |
18196 KB |
Output is correct |
| 11 |
Correct |
46 ms |
18372 KB |
Output is correct |
| 12 |
Correct |
45 ms |
18428 KB |
Output is correct |
| 13 |
Correct |
49 ms |
18420 KB |
Output is correct |
| 14 |
Correct |
48 ms |
18500 KB |
Output is correct |
| 15 |
Correct |
46 ms |
18340 KB |
Output is correct |
| 16 |
Correct |
319 ms |
28864 KB |
Output is correct |
| 17 |
Correct |
302 ms |
28636 KB |
Output is correct |
| 18 |
Correct |
310 ms |
28720 KB |
Output is correct |
| 19 |
Correct |
259 ms |
28304 KB |
Output is correct |
| 20 |
Correct |
323 ms |
28004 KB |
Output is correct |
| 21 |
Correct |
336 ms |
29836 KB |
Output is correct |
| 22 |
Correct |
330 ms |
29668 KB |
Output is correct |
| 23 |
Correct |
341 ms |
29992 KB |
Output is correct |
| 24 |
Correct |
326 ms |
29528 KB |
Output is correct |
| 25 |
Correct |
325 ms |
29016 KB |
Output is correct |
