题意
有n头不同编号的牛(范围是1-n),已知每头牛前面有多少头牛的编号比它小,求这n头牛的顺序。
思路
从后往前遍历输入的序列,每个a[i]表示这头牛在剩余的空位中第a[i]+1的空位上,然后删除这个空位,循环结束就能得到答案,线段树结点维护左右区间和剩余的空位sum,具体见代码实现,跟着代码手动模拟一遍就懂了。
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
const int MAX_N = 8010;
struct node {
int l, r, sum;
}tr[MAX_N * 4];
int ans[MAX_N];
int a[MAX_N];
int index;
int n, x;
void pushup(int u) {
tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
}
void build(int u,int l,int r) {
tr[u].l = l, tr[u].r = r;
if (l == r) {
tr[u].sum = 1;
return;
}
int mid = l + r >> 1;
build(u << 1, l, mid);
build(u << 1 | 1, mid + 1, r);
pushup(u);
}
void query(int u, int pos) {
if (tr[u].l == tr[u].r) {
tr[u].sum--;
ans[index] = tr[u].r;
return;
}
int mid = tr[u].l + tr[u].r >> 1;
if (tr[u << 1].sum >= pos)query(u << 1, pos);
else query(u << 1 | 1, pos - tr[u << 1].sum);
pushup(u);
}
int main() {
cin >> n;
index = n;
build(1, 1, n);
for (int i = 2; i <= n; i++) {
scanf("%d", &a[i]);
}
a[1] = 0;
for (int i = n; i >= 1; i--) {
query(1, a[i]+1);
index--;
}
for (int i = 1; i <= n; i++)printf("%d\n", ans[i]);
return 0;
}