Poj(2182)——Lost Cows(线段树)
发布日期:2021-09-19 06:09:08 浏览次数:0 分类:技术文章


N (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacular display of poor judgment, they visited the neighborhood 'watering hole' and drank a few too many beers before dinner. When it was time to line up for their evening meal, they did not line up in the required ascending numerical order of their brands. 

Regrettably, FJ does not have a way to sort them. Furthermore, he's not very good at observing problems. Instead of writing down each cow's brand, he determined a rather silly statistic: For each cow in line, he knows the number of cows that precede that cow in line that do, in fact, have smaller brands than that cow. 

Given this data, tell FJ the exact ordering of the cows. 


* Line 1: A single integer, N 

* Lines 2..N: These N-1 lines describe the number of cows that precede a given cow in line and have brands smaller than that cow. Of course, no cows precede the first cow in line, so she is not listed. Line 2 of the input describes the number of preceding cows whose brands are smaller than the cow in slot #2; line 3 describes the number of preceding cows whose brands are smaller than the cow in slot #3; and so on. 


* Lines 1..N: Each of the N lines of output tells the brand of a cow in line. Line #1 of the output tells the brand of the first cow in line; line 2 tells the brand of the second cow; and so on.

#include<stdio.h>#include<string.h>#define maxn 10000int small[maxn],ans[maxn];	//ans是用来存储结果的;  struct node{	int lc,rc,len;}s[4*maxn];void build(int root,int lc,int rc){	s[root].lc=lc;	s[root].rc=rc;	s[root].len=rc-lc+1;	if(lc==rc) return ;	build(2*root,lc,(lc+rc)/2);	build(2*root+1,(lc+rc)/2+1,rc);}int query(int root,int k){	s[root].len--;	if(s[root].lc==s[root].rc)return s[root].lc;	else if(s[2*root].len>=k) return query(root*2,k);	else return query(root*2+1,k-s[root*2].len);}int main(){	int n;	scanf("%d",&n);	for(int i=2;i<=n;i++) scanf("%d",&small[i]);	small[1]=0;	build(1,1,n);	for(int i=n;i>=1;i--){		//这里的意思是:前面有几个比它小的,那么它就在原来的地方排第small+1位; 		ans[i]=query(1,small[i]+1);	}	for(int i=1;i<=n;i++) printf("%d\n",ans[i]);}

上一篇:Poj(3468)——A Simple Problem with Integers(线段树)
下一篇:Codeforces Round #305 (Div. 2) C. Mike and Frog +B. Mike and Fun