Codeforces Round #388(Div. 2)C. Voting【模拟】

C. Voting
time limit per test 1 second
memory limit per test 256 megabytes
input standard input
output standard output
There are n employees in Alternative Cake Manufacturing (ACM). They are now voting on some very important question and the leading world media are trying to predict the outcome of the vote.

Each of the employees belongs to one of two fractions: depublicans or remocrats, and these two fractions have opposite opinions on what should be the outcome of the vote. The voting procedure is rather complicated:

Each of n employees makes a statement. They make statements one by one starting from employees 1 and finishing with employeen. If at the moment when it's time for the i-th employee to make a statement he no longer has the right to vote, he just skips his turn (and no longer takes part in this voting).
When employee makes a statement, he can do nothing or declare that one of the other employees no longer has a right to vote. It's allowed to deny from voting people who already made the statement or people who are only waiting to do so. If someone is denied from voting he no longer participates in the voting till the very end.
When all employees are done with their statements, the procedure repeats: again, each employees starting from 1 and finishing withn who are still eligible to vote make their statements.
The process repeats until there is only one employee eligible to vote remaining and he determines the outcome of the whole voting. Of course, he votes for the decision suitable for his fraction.
You know the order employees are going to vote and that they behave optimal (and they also know the order and who belongs to which fraction). Predict the outcome of the vote.

Input
The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of employees.

The next line contains n characters. The i-th character is 'D' if the i-th employee is from depublicans fraction or 'R' if he is from remocrats.

Output
Print 'D' if the outcome of the vote will be suitable for depublicans and 'R' if remocrats will win.

Examples
input
5
DDRRR
output
D
input
6
DDRRRR
output
R
Note
Consider one of the voting scenarios for the first sample:

Employee 1 denies employee 5 to vote.
Employee 2 denies employee 3 to vote.
Employee 3 has no right to vote and skips his turn (he was denied by employee 2).
Employee 4 denies employee 2 to vote.
Employee 5 has no right to vote and skips his turn (he was denied by employee 1).
Employee 1 denies employee 4.
Only employee 1 now has the right to vote so the voting ends with the victory of depublicans.

题目大意:

有两队人一队是D另一队是R,然后给你一串他们的排队顺序,按照顺序来进行操作,每个人可以将不是自己队伍的人砍死,被砍死的人不能进行操作,直到有一队伍的人死光才结束游戏,如果剩下的是D则cout<<D<<endl; else cout<<R<<endl;

思路

每个人进行操作肯定是将离自己最近的敌人砍死来达到最优,比如DRDR,第一个D将第一个R砍死后第一个R就不能进行操作直接到第二个D操作,所以我们只需要用两个队列来模拟这个贪心的过程就可以了,向队列插入输入的坐标来进行比较谁在前面谁在后面

#include "bits/stdc++.h"
using namespace std;
int main() {
    int n;
    string s;
    cin >> n >> s;
    queue<int> d;
    queue<int> r;
    for (int i = 0; i < n; i++) {
        if (s[i] == 'D') d.push(i);
        else r.push(i);
    }
    while (!d.empty() && !r.empty()) {
        int a = d.front();
        int b = r.front();
        d.pop();
        r.pop();
        if (a < b) {
            d.push(a + n);
//            cout<<a<<endl;
        }
        if (a > b) {
            r.push(b + n);
//            cout<<b<<endl;
        }
    }
//    cout << d.size() << " " << r.size() << endl;
    if (d.empty()) cout << "R" << endl;
    else cout << "D" << endl;
    return 0;
}