Problem:
Score : 100 points

Problem Statement

We have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is S, it means it was sunny on the i-th day; if that character is R, it means it was rainy on that day.

Find the maximum number of consecutive rainy days in this period.

Constraints

|S| = 3

Each character of S is S or R.

Input

Input is given from Standard Input in the following format:

S

Output

Print the maximum number of consecutive rainy days in the period.

Sample Input 1

RRS

Sample Output 1

2

We had rain on the 1-st and 2-nd days in the period. Here, the maximum number of consecutive rainy days is 2, so we should print 2.

Sample Input 2

SSS

Sample Output 2

0

It was sunny throughout the period. We had no rainy days, so we should print 0.

Sample Input 3

RSR

Sample Output 3

1

We had rain on the 1-st and 3-rd days - two "streaks" of one rainy day, so we should print 1.

Solution in C++ (GCC 9.2.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
#define fr(i,a,b) for(ll i=a; i<b; i++)
#define rf(i,a,b) for(ll i=a; i>=b; i--)
#define pb push_back
#define mp make_pair
#define show(a) for(auto el:a)cout<<el<<" "
#define ff first
#define ss second
#define pair vector<pair<ll,ll>>
#define vec vector <ll> 
#define all(a) a.begin(),a.end()
#define mo 1000000007




int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int test;
    cin>>test;
    for(int ti=0;ti<test;ti++)
    {
        char s[10001];
        ll n,i,j=0;
        cin>>s;
        n=strlen(s);
        ll su;
        vector<ll> v;
         ll c=0;
        for(i=0;i<n;i++)
        {
           c=0;
            if(s[i]=='R')
            {
                for(j=i;j<n;j++)
                {
                     if(s[j]=='S')
                   {
                       v.pb(c);
                       c=0;
                       break;
                   }
                    c++;
                   // cout<<j<<" ";
                  
                }
    
                i=j-1;
            }
            if(j==n && s[n-1]=='R')
            {
                v.pb(c);
                break;
            }
        }
        sort(all(v));
        reverse(all(v));
        ll k=v.size();
        if(k==0)
        su=0;
        else
        su=v[0];
     
        cout<<su<<"\n";
        
        
    
          
     }
    
     return 0;
}