题目地址:点击打开链接
给出n和每个数之前比它小的数有几个 需要输出原序列,最后一个数的真实值为a[N]+1
将a[N]+1在序列中删去,更新a[i],那么第N-1个数的真实值为a[N-1]+1。
做法很多,线段树,树状数组加二分或是枚举都可以。
线段树代码:
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 8e3+5;
int tree[maxn*4], ans[maxn], a[maxn], n; //tree数组记录该区间剩余可放的牛数
void build(int root, int l, int r)
{
tree[root] = r-l+1;
if(l==r) return ;
int mid = (r+l)/2;
build(root*2, l, mid);
build(root*2+1, mid+1, r);
}
int query(int root, int l, int r, int pos)
{
int mid = (l+r)/2;
tree[root]--; //肯定会插在这个区间,所以这个区间的数量要减一
if(l == r) return l;
if(pos <= tree[root*2]) return query(root*2, l, mid, pos); //左边能放放左边
else return query(root*2+1, mid+1, r, pos-tree[root*2]); //左边放不下,放右边第pos-左边位置数
}
int main(void)
{
while(cin >> n)
{
a[1] = 0;
for(int i = 2; i <= n; i++)
scanf("%d", &a[i]);
build(1, 1, n);
for(int i = n; i >= 1; i--)
ans[i] = query(1, 1, n, a[i]+1);
for(int i = 1; i <= n; i++)
printf("%d\n", ans[i]);
}
return 0;
}
树状数组+二分代码:
/*
从第n个位置开始逆序二分查找当前位置的编号,
用树状数组来维护每头牛前面有多少头牛,
(初始时每个位置都有牛,也就是都是1)
每次查到当前位置应该是ans时,把ans位置改为0,
然后修改维护新的数组
*/
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 8e3+5;
int tree[maxn], a[maxn], ans[maxn], n;
int lowbit(int x) { return x&-x; }
void update(int pos, int val)
{
while(pos < maxn)
{
tree[pos] += val;
pos += lowbit(pos);
}
}
int query(int pos)
{
int sum = 0;
while(pos)
{
sum += tree[pos];
pos -= lowbit(pos);
}
return sum;
}
int bs(int num)
{
int l = 1, r = n, t;
while(l <= r)
{
int mid = (l+r)/2;
int tnum = query(mid);
if(tnum >= num) t = mid, r = mid-1;
else l = mid+1;
}
return t;
}
int main(void)
{
while(cin >> n)
{
memset(tree, 0, sizeof(tree));
a[1] = 0;
update(1, 1);
for(int i = 2; i <= n; i++)
scanf("%d", &a[i]), update(i, 1);
for(int i = n; i >= 1; i--)
{
int pos = bs(a[i]+1);
ans[i] = pos;
update(pos, -1);
}
for(int i = 1; i <= n; i++)
printf("%d\n", ans[i]);
}
return 0;
}
枚举代码:
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn = 8005;
bool book[maxn];
int a[maxn], ans[maxn];
int main(void)
{
int n;
while(cin >> n)
{
memset(book, 0, sizeof(book));
for(int i = 1; i < n; i++) scanf("%d", &a[i]);
int t = n;
for(int i = n-1; i >= 1; i--)
{
int count = -1, k = 1;
for(k = 1; k <= n; k++)
{
if(!book[k]) count++;
if(count == a[i]) { book[k] = 1; break; }
}
ans[t--] = k;
}
for(int i = 1; i <= n; i++)
if(!book[i]) { ans[t] = i; break; }
for(int i = 1; i <= n; i++)
cout << ans[i] << endl;
}
return 0;
}