#include "plants.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define pll pair <ll,ll>
#define fi first
#define se second
#define MP make_pair
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1)
#define MASK(i) (1LL<<(i))
namespace trung{
const ll MAXN = 2e5+100;
const ll INF = 1e9+7;
ll n,k;
vector <int> val;
namespace seg{
pll tree[MAXN*4];
ll lazy[MAXN*4];
pll combine(pll x,pll y){
if (x.fi > y.fi)return y;
else return x;
}
void build(ll id=1,ll l=0,ll r=n-1){
if (l==r){tree[id] = MP(val[l],l);}
else{
ll mid = (l + r) >> 1;
build(id<<1,l,mid);
build(id<<1|1,mid+1,r);
tree[id] = combine(tree[id<<1],tree[id<<1|1]);
}
}
void push(ll id,ll x){
tree[id].fi+=x;
lazy[id]+=x;
}
void lz(ll id){
push(id<<1,lazy[id]);
push(id<<1|1,lazy[id]);
lazy[id] = 0;
}
void update(ll l1,ll r1,ll id=1,ll l=0,ll r=n-1){
// if (id==1)cout<<"UPD "<<l1<<' '<<r1<<endl;
if (l1 > r || l > r1 || l1 > r1)return;
if (l1 <= l && r <= r1){
// cout<<"UPD2 "<<l<<' '<<r<<endl;
push(id,-1);
return;
}
lz(id);
ll mid = (l + r) >> 1;
update(l1,r1,id<<1,l,mid);
update(l1,r1,id<<1|1,mid+1,r);
tree[id] = combine(tree[id<<1],tree[id<<1|1]);
}
void del(ll i,ll id=1,ll l=0,ll r=n-1){
if (l > i || i > r)return;
if (l==r){
// cout<<"BRUH "<<i<<endl;
tree[id].fi = INF;
return;
}
lz(id);
ll mid = (l + r) >> 1;
del(i,id<<1,l,mid);
del(i,id<<1|1,mid+1,r);
tree[id] = combine(tree[id<<1],tree[id<<1|1]);
}
ll get(ll l1,ll r1,ll id=1,ll l=0,ll r=n-1){
if (l1 > r || l > r1 || l1 > r1)return n+1;
if (tree[id].fi!=0)return n+1;
if (l1 <= l && r <= r1)return tree[id].se;
lz(id);
ll mid = (l + r) >> 1;
ll res = get(l1,r1,id<<1,l,mid);
if (res==n+1)res = get(l1,r1,id<<1|1,mid+1,r);
return res;
}
ll sus(ll i,ll id=1,ll l=0,ll r=n-1){
if (i > r || l > i)return INF+1;
if (l == r)return tree[id].fi;
lz(id);
ll mid = (l + r) >> 1;
return min(sus(i,id<<1,l,mid),sus(i,id<<1|1,mid+1,r));
}
}
ll h[MAXN];
ll label;
bool in[MAXN];
vector <ll> all;
void solve(ll x){
// assert(in[x] == 0);
// in[x] = 1;
ll l = x-k+1,r=x-1;
// cout<<x<<' '<<l<<' '<<r<<endl;
ll tmp;
while ((tmp=seg::get(l,r)) != n+1){
solve(tmp);
}
while ((tmp=seg::get(l+n,r+n)) != n+1){
// cout<<x<<' '<<tmp<<endl;
solve(tmp);
}
all.push_back(x);
seg::del(x);
h[x] = --label;
seg::update(l,r);
seg::update(l+n,r+n);
}
}
void init(int K, std::vector<int> r){
using namespace trung;
val = r;
n=sz(r);
k=K;
seg::build();
// cout<<"OK"<<endl;
ll cur;
label = n;
while ((cur=seg::get(0,n-1)) != n+1){
// cout<<"CUR "<<cur<<endl;
solve(cur);
for (auto x:all){
}
all.clear();
}
// for (ll i = 0;i < n;i ++)cout<<h[i]<<' ';
// cout<<'\n';
// for (ll i = 0;i < n;i ++){
// ll cnt = 0;
// for (ll j = 1;j < k;j ++){
// if (h[(i+j)%n] > h[i])cnt++;
// }
// assert(cnt==r[i]);
// }
}
int compare_plants(int x, int y){
using namespace trung;
return (h[x] > h[y] ? 1 : -1);
}
