#include "plants.h"
#include <bits/stdc++.h>
#define N 200100
int pos[N], cnt, K;
int mval[4*N], mpos[4*N], l[4*N],r[4*N], sub[4*N];
void pd(int n) {
if(sub[n]) {
mval[n]-=sub[n];
if(l[n]!=r[n])
sub[n*2]+=sub[n],
sub[n*2+1]+=sub[n];
sub[n] = 0;
}
}
std::vector<int> R;
void upd(int n) {
if(mval[2*n]!=mval[2*n+1])
if(mval[2*n]>mval[2*n+1])
mval[n] = mval[2*n+1],
mpos[n] = mpos[2*n+1];
else mval[n] = mval[2*n],
mpos[n] = mpos[2*n];
else {
int dist = mpos[2*n+1]-mpos[2*n];
int dist2 = R.size() - dist;
if(dist>=K)
mval[n] = mval[2*n+1],
mpos[n] = mpos[2*n+1];
else mval[n] = mval[2*n],
mpos[n] = mpos[2*n];
}
}
void build(int i, int lp, int rp) {
l[i] = lp, r[i] = rp;
if(lp==rp)
mval[i] = R[lp-1],
mpos[i] = lp;
else build(i*2,lp,lp+rp>>1),
build(i*2+1,lp+rp+2>>1,rp),
upd(i);
}
#define n R.size()
void update(int i, int rl, int rr, int v) {
pd(i);
if(rl<=l[i]&&r[i]<=rr)
return (void)(sub[i]-=v,pd(i));
if(rl<=r[i*2])
update(i*2,rl,rr,v);
if(r[i*2]<rr)
update(i*2+1,rl,rr,v);
pd(i*2);
pd(i*2+1);
upd(i);
}
void init(int k, std::vector<int> r) {
K=k;
R = r;
build(1,1,n);
for(int i = 0; i < n; i++) {
int x = mpos[1];
std::cerr << x << '\n';
pos[x-1] = ++cnt;
if(x<k) {
update(1,1,x,-1);
update(1,n-k+x+1,n,-1);
} else {
update(1,x-k+1,x,-1);
}
update(1,x,x,1e9);
}
return;
}
int compare_plants(int x, int y) {
return pos[x]<pos[y]?1:-1;
}
