cf——B. Domino Effect

Little Chris knows there's no fun in playing dominoes, he thinks it's too random and doesn't require skill. Instead, he decided to play withthe dominoes and make a "domino show".

Chris arranges n dominoes in a line, placing each piece vertically upright. In the beginning, he simultaneously pushes some of the dominoes either to the left or to the right. However, somewhere between every two dominoes pushed in the same direction there is at least one domino pushed in the opposite direction.

After each second, each domino that is falling to the left pushes the adjacent domino on the left. Similarly, the dominoes falling to the right push their adjacent dominoes standing on the right. When a vertical domino has dominoes falling on it from both sides, it stays still due to the balance of the forces. The figure shows one possible example of the process.

Given the initial directions Chris has pushed the dominoes, find the number of the dominoes left standing vertically at the end of the process!

Input

The first line contains a single integer n (1 ≤ n ≤ 3000), the number of the dominoes in the line. The next line contains a character strings of length n. The i-th character of the string si is equal to

• "L", if the i-th domino has been pushed to the left;
• "R", if the i-th domino has been pushed to the right;
• ".", if the i-th domino has not been pushed.

It is guaranteed that if si = sj = "L" and i < j, then there exists such k that i < k < j and sk = "R"; if si = sj = "R" and i < j, then there exists such k that i < k < j and sk = "L".

Output

Output a single integer, the number of the dominoes that remain vertical at the end of the process.

Sample test(s)

input

14
.L.R...LR..L..

output

4

input

5
R....

output

0

input

1
.

output

1

Note

The first example case is shown on the figure. The four pieces that remain standing vertically are highlighted with orange.

In the second example case, all pieces fall down since the first piece topples all the other pieces.

In the last example case, a single piece has not been pushed in either direction.

 题意：点代表竖直的，R代表 右斜的，L代表左斜的，输出最后能有几个竖直的

 已知： 只要R L，并且中间的点数是 奇数个，则竖直的有 一个；

只要是LR,则 竖直的是个数是 中间的点数

#include<iostream>
#include <cstring>
#include <algorithm>
using namespace std;
char s[3005];
int main()
{
    int n;
    while(cin>>n)
    {
        cin>>s;
        int num=0;
        char str='*';
        int temp=-1;
        for(int i=0; i<n; i++)
        {
            if(s[i]=='L')
            {
                if(str=='R')
                {
                    if((i-temp-1)%2!=0)
                        num++;
                    str='*';
                    temp=i;
                }
                else
                {
                    str='L';
                    temp=i;
                }
            }
            else if(s[i]=='R')
            {
                if(str=='L'||str=='*')
                {
                    num+=i-temp-1;
                    str='R';
                    temp=i;
                }
                else if(str=='R')
                {
                    temp=i;
                }
            }
        }
        if(str!='R')
        {
            num+=n-temp-1;
        }
        cout<<num<<endl;
    }
    return 0;
}