codeforces 405B Domino Effect (模拟题，中等难度，细心就能一遍AC)

1、http://codeforces.com/problemset/problem/405/B

2、题目大意：

给出n张牌和他们要倒的方向，我们知道一张倒的牌会压到其余的一边相邻的所有牌，同时题目又给出有往左倒的有往右倒的，如果往左倒的和往右倒的牌数相同的话就可以使得中间的牌还是站立的，最后输出有几张牌站立着

3、解题思路

题目其实很简单，模拟就行，分这么几种情况，如果第一张方向倒的是往左的，那么左边从第一张到目前的无一幸免都得倒下去，如果最后是R，那么后边的都得倒，中间的就需要判断LR之间的牌数是奇数就cnt++,因为中间的牌能最终站立着，只要处理好了两边的情况，就OK了，写完代码之后自己测了10多组样例结果测出代码好几处错误，改完自己的测试样例后，一遍就AC了，交题前的测试好重要。。。

4、题目：

B. Domino Effect

time limit per test

1 second standard output

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 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.

5、AC代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define N 3005
char s[N];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        scanf("%s",s+1);
        int flag=0;
        int cnt=0,j,qr=0,ql=0,flag1=0;
        for(int i=1; i<=n; i++)
        {
            if(s[i]=='R' && flag==0)
            {
                cnt+=(i-1);
                flag=1;
                qr=i;
            }
            if(s[i]=='R')
            {
                flag=1;
                qr=i;
                flag1=0;
                for(j=i+1; j<=n; j++)
                {
                    if(s[j]=='L')
                    {
                        ql=j;
                        if((j-i-1)%2==1)
                        {
                            cnt++;

                        }
                        flag1=1;
                        break;
                    }
                }
                if(flag1==1)
                    i=j;
            }
            else if(s[i]=='L')
            {

                ql=i;
                flag1=0;
                if(flag==1)
                {
                    for(j=i+1; j<=n; j++)
                    {
                        if(s[j]=='R')
                        {
                            qr=j;
                            if((j-i-1)%2==1)
                            {
                                cnt++;
                            }
                            flag1=1;
                            break;
                        }
                    }
                    if(flag1==1)
                        i=j;
                }
                flag=1;
            }
            else if(s[i]=='.' && flag==1)
            {
                cnt++;
            }
        }
        if(qr>ql)
        {
            cnt=cnt-(n-qr);
        }
        if(qr==ql)
        {
            cnt=n;
        }
        printf("%d\n",cnt);
    }
    return 0;
}
/*
14
.L.R...LR..L..
5
R....
1
.
5
R...L
5
LR...
*/