HDU Lost Cows

The problem can use tree_array and binary_search to get answer.It's also can use force algorithm to solve it . The data of this problem is so weak.

The portal:http://acm.hdu.edu.cn/showproblem.php?pid=2711

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>

//Force Algorithm
/*
const int N = 8005;

int a[N];
int b[N];
int ans[N];

void Deal_with(){
	int n;
	while(~scanf("%d",&n)){
		memset(b,0,sizeof(b));
		for(int i=0;i<n-1;i++){
			scanf("%d",a+i);
		}
		for(int i=n-2;i>=0;i--){
			for(int j=1;j<=n;j++){
				if(!b[j]){
					if(a[i] == 0){
						//printf("%d\n",j);
						ans[i+1] = j;
						b[j] = 1;
						break;
					}
					else{
						a[i] --;
					}
				}
			}
		}
		for(int j=1;j<=n;j++){
			if(!b[j]) ans[0] = j; 
		}
		for(int i=0;i<n;i++){
			printf("%d\n",ans[i]);
		}
	}
}

int main(void){
	freopen("a.in","r",stdin);
	Deal_with();
	return 0 ;
}
*/

//Tree_Array Algorithm.
const int M = 8005;
const int N = 8005;

int Bit[M << 1];
int a[N],ans[N];

void Insert(int x,int value){
	for(int i = x;i <= M; i += i & (-i)){
		Bit[i] += value; 
	}
}

int Query(int x){
	int ret = 0;
	if(x == 0) return ret;
	for(int i = x; i ;i -= i & (-i)){
		ret += Bit[i];
	}
	return ret;
}

int Binary_search(int x,int n){
	int Left = 0 ,Right = n;
	int Mid ;
	//Use this patten you can quit the Binary_search loop;
	while(Left < Right){
		Mid = (Left + Right) >> 1;
		int temp_sum = Query(Mid);
		if(temp_sum < x){
			Left = Mid + 1;
		}
		else {
			Right = Mid ; 
		}
	}
	//Search a Mid to make Query(mid) == x;
	//Don't return Mid ,Because Mid may < Right in some circumstances; 
	return Right;
}

void Deal_with(){
	int n;
	while(~scanf("%d",&n)){
		a[0] = 0; 
		for(int i = 1; i < n; i++){
			scanf("%d",a+i);
		}
		//memset(Bit,0,sizeof(Bit)); It's not useful. Because Bit can revert to '0'.
		//memset(ans,0,sizeof(ans));
		for(int i = 1;i <= n;i++){
			Insert(i,1);
		}
		for(int i = n-1; i >= 0; i--){
			ans[i] = Binary_search(a[i]+1,n);
			//Use Binary_search to get answer;
			Insert(ans[i],-1);
			//Delete ans[i] because ans[i] is being take out.
		}
		for(int i = 0 ; i < n ; i++ ){
			printf("%d\n",ans[i]);
		}
	}
}

int main(void){
	freopen("a.in","r",stdin);
	Deal_with();
	return 0;
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/NMfloat/article/details/46834313
想对作者说点什么? 我来说一句

hdu--Lost Cows

Description N (2

Foverve1 Foverve1

2016-08-14 09:06:22

阅读数:106

poj 2182 lost cows

树状数组

chai_jing chai_jing

2016-07-08 17:26:30

阅读数:268

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭