codeforces 405B Playing Dominoes

                                       Playing Dominoes

     思路：

    1.找到第一个非’.‘的位置 若为n则全为所求

    2.第一个非’.‘如果是R 则...若为L 则...

    3.记录每一个非’.‘的位置

    4.遍历所有R或L至倒数第二个，只考虑当前R或L与下一个L或R的位移,

    5.考虑最后一个R或L后面的’.‘

                                            Time Limit:1000MS    Memory Limit:262144KB    64bit IO Format:%I64d & %I64u

Description

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 with the 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 string s of length n. The i-th character of the string s_i 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 s_i = s_j = "L" and i < j, then there exists such k that i < k < j and s_k = "R"; if s_i = s_j = "R" and i < j, then there exists such k that i < k < j and s_k = "L".

Output

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

Sample Input

Input

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

Output

4

Input

5
R....

Output

0

Input

1
.

Output

1

Hint

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.

AC代码

#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
char s[3030];
int lr[3030];
int main()
{
    int n,place,i,j;
    char first;
    while(scanf("%d",&n)!=EOF)
    {
        scanf("%s",s);
        int llrr=0,count=0;
         for(i=0;i<n;i++)
        {
            if(s[i]!='.') break;
        }
        if(i==n) { count=n;}
        else {
          first=s[i];
          place=i;
          if(first=='R') count+=place;
          for(i=place;i<n;i++)
          {
            if(s[i]=='.') continue;
            if(s[i]!='.') {lr[llrr]=i;llrr++;}
          }
          for(i=0;i<llrr-1;i++)
          {
            if(s[lr[i]]=='R') count+=((lr[i+1]-lr[i])%2==1)?0:1;
            if(s[lr[i]]=='L') count+=lr[i+1]-lr[i]-1;
          }
          if(s[lr[llrr-1]]=='L') count+=(n-1-lr[llrr-1]);
        }
          printf("%d\n",count);
    }

    return 0;
}