Ural 1521. War Games 2

PRO IS HERE

简单的数状数组 + 二分搜索。

CODE：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<sstream>
#include<iostream>
using namespace std;

#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
#define DOR(i,a,b) for(int (i)=(a);(i)>=(b);(i)--)
#define bug puts("Fuck");
#define LL long long
#define pb push_back
#define mp make_pair

#define nMax 101000
#define eps 1e-8
#define inf 0x7fffffff

int n,k;
int sum[nMax];
int vis[nMax];
void ins(int i,int k){
	while(i<=n) {
		sum[i] += k;
		i+=i&-i;
	}
}
int Sum(int i){
	int ans=0;
	while(i) {
		ans += sum[i];
		i-=i&-i;
	}
	return ans;
}
int total;
int bsearch(int k){
	if(k==0) k=total;
	int l=1,r=n;
	while(l<=r){
		int mid = (l+r)>>1;
		if(Sum(mid) > k){
			r=mid-1;
		}else if(Sum(mid) < k){
			l=mid+1;
		}else {
			if(!vis[mid]) return mid;
			else r=mid-1;
		}
	}
	return l;
}

int main(){
#ifndef ONLINE_JUDGE  
	freopen("input.txt","r",stdin);
//	freopen("output.txt","w",stdout);
#endif
	while(~scanf("%d%d",&n,&k)){
		total = n;
		int first=1;
		memset(sum,0,sizeof(sum));
		for(int i=1;i<=n;i++){
			ins(i,1);
			vis[i]=0;
		}
		int tot = 0;
		for(int i=1;i<=n;i++){
			tot = bsearch((k+Sum(tot))%total);
			printf("%d ",tot);
			total--;
			vis[tot]=1;
			ins(tot,-1);
		}
		printf("\n");
	}

	return 0;
}