fork(2) download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. long long n,sum[2000000],maxx=-1,k,ans;
  4. map<long long,long long> mp;
  5. string a='0'+a;
  6. int main(){
  7. ios::sync_with_stdio(false);
  8. cin.tie(0);
  9. cout.tie(0);
  10. cin>>a;
  11. mp[0]=0;
  12. for(int i=1;i<a.size();i++){
  13. if(a[i]=='G'){
  14. sum[i]=sum[i-1]+1;
  15. }else{
  16. sum[i]=sum[i-1]-1;
  17. }
  18. if(mp.find(sum[i])==mp.end()){
  19. mp[sum[i]]=i;
  20. }else{
  21. ans=max(ans,i-mp[sum[i]]);
  22. }
  23. }
  24. cout<<ans;
  25. return 0;
  26. }
Success #stdin #stdout 0.01s 5320KB
stdin
GRGGRG
stdout
4