Codeforces 1324C - Frog Jumps Solution

 ///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

    ///Islamic University,Bangladesh

    #include <bits/stdc++.h>

    using namespace std;

    int main()

    {

        int t,r,l,ans,mx;

        cin>>t;

        while(t--)

        {

            r=1,l=1,mx=1;

            string s;

            cin>>s;

            for(int i=0; i<s.size(); i++)

            {

                if(s[i]=='L')

                    l++;

                else

                    l=1;

                mx=max(l,mx);

            }

            cout<<mx<<endl;

        }

    }


    No comments

    Most View Post

    Recent post

    Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

        Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

    Powered by Blogger.