POJ 2886 Who Gets the Most Candies? 线段树 反素数

Debug好爽。

传送门：http://poj.org/problem?id=2886

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

using namespace std;

const int MAXN = 500005;
long long INF = (long long) 1 << 60;
long long prime[20] = {0,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53};
int val ;

struct Node {
	int x,y;
	int v;
	int point;
}t[MAXN<<2];

struct He{
	int point ;
	char name[20];
}a[MAXN];

void Push_Up(int rt) {
	t[rt].v = t[rt<<1].v + t[rt<<1|1].v;
}

void Build(int x,int y,int rt) {
	t[rt].x = x ; t[rt].y = y;
	if(x == y) {
		t[rt].v = 1;
		return ;
	}
	int mid = (x + y) >> 1;
	Build(x,mid,rt<<1);
	Build(mid+1,y,rt<<1|1);
	Push_Up(rt);
}

void Update(int rt,int k) {
	if(t[rt].x == t[rt].y) {
		t[rt].v = 0;
		val = t[rt].x;
		return ;
	}
	int mid = (t[rt].x + t[rt].y) >> 1;
	if(t[rt<<1].v >= k) {
		Update(rt<<1,k);
	}
	else {
		Update(rt<<1|1,k-t[rt<<1].v);
	}
	Push_Up(rt);
}

int Query(int rt,int left,int right) {
    if(right < left) return 0;
	if(left <= t[rt].x && right >= t[rt].y) {
		return t[rt].v ;
	}
	int ans = 0;
	int mid = (t[rt].x + t[rt].y) >> 1;
	if(mid >= left) {
		ans += Query(rt<<1,left,right);
	}
	if(mid < right) {
		ans += Query(rt<<1|1,left,right);
	}
	return ans;
}

void print(int rt) {
	printf("x : %d y : %d val : %d\n",t[rt].x,t[rt].y,t[rt].v);
	if(t[rt].x == t[rt].y) return;
	print(rt<<1);
	print(rt<<1|1);
}

long long numk;
long long totn ;

long long fast_pow(int x,int k) {
	long long base = x;
	long long ans = 1;
	while(k) {
		if(k & 1) ans *= base;
		base *= base;
		k >>= 1;
	}
	return ans;
}

void DFS(int depth,long long num,int lim ,long long tot,long long n) {
/*搜素小于n的最小的数 k ,使得f(k)最大 f(k)是k因子的数目*/
//depth 搜素深度
//num 因子数
//lim 是下个因子的最大数目
//tot 数的大小
//n是要搜素的数
    //printf("depth : %d num : %lld tot : %lld\n",depth,num,tot);
    //printf("totn  : %lld numk : %lld\n",totn,numk);
	if(tot > n) return ;
	if(tot <= 0) return ;
	if(num == numk && tot < totn) {
		totn = tot;
	}
	if(num > numk) {
		totn = tot;
		numk = num;
	}
	for(int i = 2 ; i <= lim; i++) {
		//枚举每层k值得大小;
		DFS(depth+1,num * i, i ,tot * fast_pow(prime[depth],i-1) ,n);
	}
}


void Deal_with() {
	int n,k;
	while(~scanf("%d %d",&n,&k)) {
        //printf("%d %d\n",n,k);
        for(int i = 1; i  <= n ; i ++) {
			scanf("%s %d",a[i].name,&a[i].point);
            //printf("%d %s\n",a[i].point,a[i].name);
		}
		Build(1,n,1);
		//print(1);
		numk = 0; totn = INF;
		//printf("totn  : %lld numk : %lld\n",totn,numk);
		DFS(1,1,50,1,n);
		//printf("totn  : %lld numk : %lld\n",totn,numk);
		int kk = k; val = k ;
		for(int i = 1 ; i < totn ; i ++) {
			Update(1,kk);
			//print(1);
			//printf("kk : %d val : %d\n",kk,val);
			if(a[val].point > 0) {
				int pp = ( a[val].point - 1 ) % ( n - i ) + 1;
				//printf("pp : %d\n",pp);
				int al = Query(1,1,val);
				int bl = Query(1,val+1,n);
				//printf("al : %d bl : %d ",al,bl);
				if(pp > bl)kk = pp - bl;
				else kk = pp + al;
				//printf("i : %d kk : %d\n",i,kk);
			}
			else {
				a[val].point = -a[val].point;
				int pp = ( a[val].point - 1 ) % ( n - i ) + 1;
				//printf("%d\n",pp);
				int al = Query(1,1,val);
				int bl = Query(1,val+1,n);
				if(pp > al){
					kk = pp - al;
 					kk = (al + bl ) - kk + 1;
				}
				else kk = al - pp + 1;
				//printf("al : %d bl : %d kk : %d\n",al,bl,kk);
			}
			//printf("name : %s\n",a[val].name);
			//val = vall;
		}
		Update(1,kk);
		printf("%s %d\n",a[val].name,numk);
	}
}

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