Codeforces Round #814 (Div. 2)C. Fighting Tournament

双端队列用坐标模拟队列中元素的移动

用win数组记录第i次后的满足答案的元素

最后再win数组中二分次数

最后得到答案

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1e9+7;
const int INF=0x3f3f3f3f;
const int N = 1e5+10;
#define ios                      \
    ios::sync_with_stdio(false); \
    cin.tie(0);                  \
    cout.tie(0);
vector<int>win[N];    
deque<int>qq;
int a[N];
int main()
{
	int t;cin>>t;
	while(t--)
	{
		int n,q;cin>>n>>q;
		for(int i=1;i<=n;i++)
		{
			win[i].clear();
		}
		while(!qq.empty())
		{
			qq.pop_back();
		}		
		for(int i=1;i<=n;i++)
		{
			cin>>a[i];
		}	
		for(int i=2;i<=n;i++)
		qq.push_back(i);
		int cur=1;
		for(int i=1;i<=n;i++)
		{
			if(a[cur]>a[qq.front()])
			{
				win[cur].push_back(i);
				int x=qq.front();
				qq.pop_front();
				qq.push_back(x);
			}
			else
			{
				win[qq.front()].push_back(i);
				qq.push_back(cur);
				cur=qq.front();
				qq.pop_front();
			}
		}
		while(q--)
		{
			int x,y;
			cin>>x>>y;
			if(y<=n)
			{
				cout<<upper_bound(win[x].begin(),win[x].end(),y)-win[x].begin()<<endl;
			}
			else
			{
				cout<<upper_bound(win[x].begin(),win[x].end(),y)-win[x].begin()+(a[x]==n?y-n:0)<<endl;
			}
		}
	}
}