2020NYIST个人积分赛第九场-I

题面

原题：CodeForces - 879B

n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, and the winner plays with the next person from the line, and so on. They play until someone wins k games in a row. This player becomes the winner.

For each of the participants, you know the power to play table tennis, and for all players these values are different. In a game the player with greater power always wins. Determine who will be the winner.

Input
The first line contains two integers: n and k (2 ≤ n ≤ 500, 2 ≤ k ≤ 1012) — the number of people and the number of wins.

The second line contains n integers a 1, a 2, …, a n (1 ≤ a i ≤ n) — powers of the player. It’s guaranteed that this line contains a valid permutation, i.e. all a i are distinct.

Output
Output a single integer — power of the winner.

Examples
Input
2 2
1 2
Output
2
Input
4 2
3 1 2 4
Output
3
Input
6 2
6 5 3 1 2 4
Output
6
Input
2 10000000000
2 1
Output
2
Note
Games in the second sample:

3 plays with 1. 3 wins. 1 goes to the end of the line.

3 plays with 2. 3 wins. He wins twice in a row. He becomes the winner.

思路

用队列模拟比赛过程。首先要思考若轮完一轮了，还没有人赢k场，这时候一定是能量最高的那个人赢；记录每一个人第一轮能赢几场就可，如果能赢到第k场，就输出当前的能量值

代码

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <vector>
#define mm 1e-11
using namespace std;
const int INF = 0x3f3f3f3f;
int a[202020];
queue<int> q;
int main()
{
	int n, k;
	cin >> n >> k;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
		q.push(a[i]);//把每个人的能量值压入队列
	}
	if (k >= n)//只有能量值为n时，才可以出现无限连胜直到赢够k次 所以要输出n
	{
		cout << n << endl;
		return 0;
	}
	int b,sum=0;
	b=q.front();//取出队列第一个值
	q.pop();//弹出
	while(!q.empty())
	{
		int c = q.front();//取出下一个人的能量值
		q.pop();
		if(b>c)//如果b>c 说明前者连胜 把当前的c放到队列最后一位
		{
			q.push(c);
			sum++;//记录连胜场次
		}
		else//b<c时 b的连胜中断 开始计算c的连胜次数
		{
			q.push(b);//把输了的b放到队列最后一位
			b = c;//把能量值大的c赋值给b
			sum = 1;//此时c已经赢了b一场了
		}
		if(sum==k)//如果连胜场次达到k次 输出当前的连胜人的能量值
		{
			cout << b << endl;
			return 0;
		}
	}
}