Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdio>
- #include <algorithm>
- #include <cstring>
- #include <string>
- #include <cctype>
- #include <stack>
- #include <bitset>
- #include <queue>
- #include <list>
- #include <vector>
- #include <map>
- #include <set>
- #include <iterator>
- #include <sstream>
- #include <stdlib.h>
- #include <cmath>
- #define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
- #define debug( x ) cout << #x << " = " << x << endl
- #define clr(v,x) memset( v, x , sizeof v )
- #define all(x) (x).begin() , (x).end()
- #define rall(x) (x).rbegin() , (x).rend()
- #define TAM 110
- using namespace std;
- typedef pair<int,int> ii ;
- typedef long long ll ;
- typedef long double ld ;
- typedef pair<int,ii> pii ;
- int main() {
- int t;string cad;
- scanf("%d",&t);getchar();
- while(t--){
- int qmark=0;int nl=0;int nr=0;int ans=0;int fn=0;
- getline(cin,cad);
- for(int i=0;i<cad.size();i++){
- if(cad[i]=='?') qmark++;
- else if(cad[i]=='L') {nl++;nr--;}
- else {nr++;nl--;}
- ans=max(nl+qmark,nr+qmark);
- fn=max(fn,ans);
- }
- printf("%d\n",fn);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement