本文主要是介绍Codeforces Round #238 (Div. 2) B题，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
字符串处理题
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!
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 a single integer, the number of the dominoes that remain vertical at the end of the process.
14 .L.R...LR..L..
4
5 R....
0
1 .
1
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.
#include<stdio.h>
#include<cstring>
#include<algorithm>
#define max 30001
int n;int domin[max];
char str[max];
void f()
{for(int i=1;i<=n;i++){if(str[i]=='L'){for(int j=i;j>0;j--){domin[j]=1;if(str[j]=='R'){if((i-j)%2==0)domin[(i+j)/2]=0;break;}}}if(str[i]=='R'){for(int j=i;j<=n;j++){domin[j]=1;if(str[j]=='L'){if((j-i)%2==0)domin[(i+j)/2]=0;i=j;break;}}}}
}
int main()
{//freopen("input.txt","r",stdin);while(~scanf("%d\n",&n)){memset(domin,0,sizeof(domin));gets(str+1);f();int count=0;for(int i=1;i<=n;i++)if(!domin[i])count++;printf("%d\n",count);}return 0;
}这篇关于Codeforces Round #238 (Div. 2) B题的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
