[Codeforces Round #627]1324C - Frog Jumps[思维]

1324C - Frog Jumps[思维]

time limit per test	memory limit per test	input	output
2 seconds	256 megabytes	standard input	standard output

Description:

There is a frog staying to the left of the string $s=s_1{s}_2\dots s_n$ consisting of $n$ characters (to be more precise, the frog initially stays at the cell $0$). Each character of s is either ${}^{\prime }{L}^{\prime }$ or ${}^{\prime }{R}^{\prime }$. It means that if the frog is staying at the $i$-th cell and the $i$-th character is ${}^{\prime }{L}^{\prime }$, the frog can jump only to the left. If the frog is staying at the $i$-th cell and the $i$-th character is ${}^{\prime }{R}^{\prime }$, the frog can jump only to the right. The frog can jump only to the right from the cell $0$.
Note that the frog can jump into the same cell twice and can perform as many jumps as it needs.
The frog wants to reach the $n+1$-th cell. The frog chooses some positive integer value $d$ before the first jump (and cannot change it later) and jumps by no more than $d$ cells at once. I.e. if the $i$-th character is ${}^{\prime }{L}^{\prime }$ then the frog can jump to any cell in a range $[max(0,i-d),i-1]$, and if the $i$-th character is ${}^{\prime }{R}^{\prime }$ then the frog can jump to any cell in a range $[i+1,min(n+1,i+d)]$.
The frog doesn’t want to jump far, so your task is to find the minimum possible value of $d$ such that the frog can reach the cell $n+1$ from the cell $0$ if it can jump by no more than $d$ cells at once. It is guaranteed that it is always possible to reach $n+1$ from $0$.
You have to answer $t$ independent test cases.

Input

The first line of the input contains one integer $t(1\le t\le 10^4)$ — the number of test cases.
The next $t$ lines describe test cases. The $i$-th test case is described as a string $s$ consisting of at least $1$ and at most $2\cdot 10^5$ characters ${}^{\prime }{L}^{\prime }$ and ${}^{\prime }{R}^{\prime }$.
It is guaranteed that the sum of lengths of strings over all test cases does not exceed $2\cdot 10^5(\sum |s|\le 2\cdot 10^5)$…

Output

For each test case, print the answer — the minimum possible value of d such that the frog can reach the cell $n+1$ from the cell $0$ if it jumps by no more than $d$ at once.

---

Example input

6
LRLRRLL
L
LLR
RRRR
LLLLLL
R

Example output

3
2
3
1
7
1

Note

The picture describing the first test case of the example and one of the possible answers:

In the second test case of the example, the frog can only jump directly from $0$ to $n+1$.
In the third test case of the example, the frog can choose $d=3$, jump to the cell $3$ from the cell $0$ and then to the cell $4$ from the cell $3$.
In the fourth test case of the example, the frog can choose $d=1$ and jump $5$ times to the right.
In the fifth test case of the example, the frog can only jump directly from 0 to $n+1$.
In the sixth test case of the example, the frog can choose $d=1$ and jump $2$ times to the right.

---

分析：
题意：
给一个长度为$n$的字符串，位置分别在$[1,n]$中
青蛙从$0$开始跳，最大距离可以跳$d$
在每个位置可以跳的方向为所在位置字符串的方向
${}^{\prime }{L}^{\prime }$就只能往左跳，${}^{\prime }{R}^{\prime }$就只能往右跳
最终要达到$n+1$的位置，问最小的$d$应该是多少
做法：
只要计算相邻的${}^{\prime }{R}^{\prime }$之间的最大距离，注意$n+1$位置也要当成一个${}^{\prime }{R}^{\prime }$，因为最后一定要跳到这个位置

Code:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxn = 2e5 + 5;
const int inf = 0x3f3f3f3f;

int read() {
    int x = 0, f = 0; char ch = getchar();
    while(ch < '0' || ch > '9') {if(ch == '-')f = -f; ch = getchar();}
    while(ch >= '0' && ch <= '9') {x = (x<<3)+(x<<1)+ch-'0'; ch = getchar();}
    return x;
}

char str[maxn];

int main() {
    int T;
    scanf("%d", &T);
    while(T--) {
        scanf("%s", str + 1);
        int len = strlen(str + 1) + 1, pre = 0, ans = 0;
        str[len] = 'R';
        for(int i = 1; i <= len; ++i) {
            if(str[i] == 'L')   continue;
            ans = max(ans, i - pre);
            pre = i;
        }
        printf("%d\n", ans);
    }
    return 0;
}

---