http://codeforces.com/problemset/problem/879/B
Description
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 after which a player leaves, respectively.
The second line contains n integers a1, a2, …, an (1 ≤ ai ≤ n) — powers of the player. It’s guaranteed that this line contains a valid permutation, i.e. all ai 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.
题意
n个人排队打乒乓球,首先一个人站在擂台上跟他之后的人打,如果能连续打败k个人就可以获胜,每次对战败的人站到队伍最后,获胜的人在擂台,每个人都有相应的已知战力值,战力高的可以打败战力低的,输出获胜的人的战力
题解
由于先后顺序,获胜的不一定是战力最高的
由于数据量很大,不能用每一次都循环一遍的方法
O(n)的方法:
从第一个人开始,如果他每战胜一个人就记录一下,如果战胜了k人就直接输出
如果出现比他厉害的,但是他还没有战胜k人
那么当前擂台上站的就是这个战力较大的人,次数从零开始计算
如果一轮也没有人可以连续获胜k次,那么获胜的就是战力最高的
因为其他人都不能打败他,只需多打几轮他的连续获胜次数肯定可以达到要求
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
#define LL long long
int main()
{
int n;
LL k,a[510],sum=0,ans;
scanf("%d%lld",&n,&k);
for(int i=0;i<n;i++)
scanf("%lld",&a[i]);
ans=a[0];
for(int i=1;i<n;i++)
{
if(ans>a[i])
sum++;
else
{
ans=a[i];
sum=1;
}
if(sum==k)
break;
}
printf("%lld",ans);
}