codeforces 388 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:

1. Each of n employees makes a statement. They make statements one by one starting from employees 1 and finishing with employee n. 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).
2. 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.
3. When all employees are done with their statements, the procedure repeats: again, each employees starting from 1 and finishing with n who are still eligible to vote make their statements.
4. 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

题意：就是DR两种字符代表持两种不同意见的人，前面的人可以选择让一个人退场，然后每个人都会选择最优策略，问你最后获胜的是D人还是R人。

思路：直接模拟，表示模拟的方法想的比较长啊，主要是不太好处理，不过按照想法直接模拟就很容易写出来啦。

把这些人看成一个循环队列就可以了，顺序从左到右不断循环。每次当前的人就选择下一个持不同意见的人离场，最后只剩下一种人就表示结束。输出这种人就好啦。

具体的实现借助了栈，然后不断跑循环，判断结束条件是跑过了一圈没有人继续立场就是啦。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
const int MAXN=2e5+10;
int n,m;
char s[MAXN];
int ans[MAXN];
int d[MAXN];
int r[MAXN];
int main()
{
    int i,j;
    int n;
    while(~scanf("%d",&n))
    {
        scanf("%s",s);
        for(i=0; i<n; ++i)
        {
            if(s[i]=='D')ans[i]=1;
            else ans[i]=0;
        }

        int pos=0;
        int cnt1=0,cnt2=0;
        for(j=0; ; ++j)
        {
            if(j-pos>n)break;
            i=j%n;
            if(ans[i]==-1)continue;
            if(ans[i])
            {
                if(cnt2)
                {
                    ans[i]=-1;
                    pos=j;
                    cnt2--;
                }
                else cnt1++;
            }
            else
            {
                if(cnt1)
                {
                    pos=j;
                    ans[i]=-1;
                    cnt1--;
                }
                else cnt2++;
            }
        }
        for(i=0; i<n; ++i)if(ans[i]!=-1)
            {
                if(ans[i])puts("D");
                else puts("R");
                break;
            }
    }
    return 0;
}