传送门
题意
分析
很久以前比赛没写出来的一道题,翻出来补一下
我们维护两个优先队列
q
,
p
q,p
q,p,把所有人的信息丢到队列
q
q
q中,同时维护前驱和后继,每次取出最大的那个,然后遍历他的前驱和后继的
k
k
k个节点,把信息丢到队列
p
p
p中,这样,只要
p
,
q
p,q
p,q两个队列的
t
o
p
top
top信息相同,就说明已经被找过了,应该
p
o
p
pop
pop掉
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
priority_queue<PII>q,p;
int a[N],pr[N],ne[N];
int st[N];
int n,k;
int main() {
read(n),read(k);
for(int i = 1;i <= n;i++){
read(a[i]);
pr[i] = i - 1;
ne[i] = i + 1;
q.push({a[i],i});
}
ne[n] = 0;
int flag = 0;
while(q.size()){
while(p.size() && q.top() == p.top()) q.pop(),p.pop();
if(!q.size()) break;
int i,j,t;
for(i = 0,j = ne[q.top().se];i < k && j;i++,j = ne[j]) {
st[j] = flag,p.push({a[j],j});
}
for(i = 0,t = pr[q.top().se];i < k && t;i++,t = pr[t]) {
st[t] = flag,p.push({a[t],t});
}
st[q.top().se] = flag;
pr[j] = t,ne[t] = j;
st[q.top().se] = flag;
q.pop();
flag ^= 1;
}
for(int i = 1;i <= n;i++) printf("%d",st[i] + 1);
return 0;
}