Codeforces Round #578 (Div. 2) A - Hotelier 【水题】

Codeforces Round #578 (Div. 2) A - Hotelier 【水题】

题目：http://codeforces.com/contest/1200/problem/A

思路：

读懂题目就能过，不多赘述

代码：

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string.h>
using namespace std;

int main() {
	int n;
	scanf("%d",&n);
	getchar();
	char s[100005];
	scanf("%s", s);
	int room[10];
	for(int i = 0; i < 10; i++)
		room[i] = 0;
	int countl= 0, countr = 9;
	for(int i = 0; i < n; i++) {
		if(s[i] >= '0' && s[i] <= '9') {
			room[s[i] - '0'] = 0;
		}
		else if(s[i] == 'L') {
			for(int i = 0; i < 10; i++) {
				if(room[i] == 0) {
					room[i] = 1;
					break;
				}
			}
		}
		else if(s[i] == 'R') {
			for(int i = 9; i >= 0; i--) {
				if(room[i] == 0) {
					room[i] = 1;
					break;
				}
			}
		}
	}
	
	for(int i = 0; i < 10; i++)
		printf("%d",room[i]);
	printf("\n");
}