codeforces 1154E 链表

用链表维护就行，学习高级数据结构也不要忘了基础的数据结构

代码用pre和suf数组模拟链表

#include<bits/stdc++.h>
using namespace std;
const int N = 2e5+100;
int pos[N],ans[N],pre[N],suf[N];
int main(){
	int n,k;
	scanf("%d%d",&n,&k);
	for(int i = 1; i <= n; i++){
		int x;
		scanf("%d",&x);
		pos[x]=i;
		pre[i]=i-1;
		suf[i]=i+1;
	}
	int now = 1;
	for(int i = n; i >= 1; i--){
		if(!ans[pos[i]]){
			ans[pos[i]]=now;
			int x = k,g,f;
			g=f=pos[i];
			while(x){
				g = pre[g];
				if(g==0) break;
				ans[g]=now;
				x--;
			}
			if(g!=0) g=pre[g];
			x = k;
			while(x){
				f = suf[f];
				if(f==n+1) break;
				ans[f]=now;
				x--;
			}
			if(f!=n+1) f=suf[f];
			//printf("g=%d f=%d\n",g,f);
			suf[g]=f;
			pre[f]=g;
			if(now==1) now++;
			else now--;
		}
	}
	for(int i = 1; i <= n; i++) printf("%d",ans[i]);
	return 0;
}