树状数组（7)

1、poj2464 Brownie Points II

http://poj.org/problem?id=2464

首先明确过一个点画十字架，bottom-left区域点的个数是可以用树状数组求出的。按x升序排列，x相等则按y升序排列。此时将y放进树状数组。求出比当前点y坐标小的点个数。即

求出bottom-left区域点的个数。另外题意也很重要：同一个y坐标上有多个点，每个点画一个横线，这样会求出一个Stan的分数，在这几个分数中必然有一个最小的。在其他同一个y坐标上的点同样画横线，依旧会求出satn分数，也存在一个最小的，我们的目标是求出这样一个点，使得最小值最大。

第一次用set。。。。

#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <set>
using namespace std;
const int MAX = 200000 + 10;
set <int> anso;
int anss;
int n,c[MAX];
int bl, br, tl, tr;
int left[MAX], right[MAX], up[MAX], down[MAX], large[MAX], pnty[MAX], num;
struct node
{
	int x;
	int y;
	int id;
}pnt[MAX];
void init()
{
	num = 1;
	anss = 0;
	anso.clear();
	memset(c, 0, sizeof(c));
	memset(left, 0, sizeof(left));
	memset(right, 0, sizeof(right));
	memset(up, 0, sizeof(up));
	memset(down, 0, sizeof(down));
	memset(large, 0, sizeof(large));
}

int lowbit(int x)
{
	return x&(-x);
}

void update(int x, int v)
{
	while (x <=n)
	{
		c[x] += v;
		x += lowbit(x);
	}
}

int getsum(int x)
{
	int sum = 0;
	while (x)
	{
		sum += c[x];
		x -= lowbit(x);
	}
	return sum;
}

bool cmpx(const node&a, const node& b)
{
	return a.x < b.x || a.x == b.x && a.y < b.y;
}
bool cmpy(const node&a, const node& b)
{
	return a.y < b.y || a.y == b.y && a.x < b.x;
}
int main()
{
	int i, x, y;
	while (scanf("%d", &n) == 1, n)
	{
		init();
		for (i=1 ;i<=n; i++)
		{
			scanf("%d%d", &pnt[i].x, &pnt[i].y);
			pnt[i].id = i;
		}
		sort(pnt+1, pnt+n+1, cmpy);
		pnty[pnt[1].id] = 1;
		for (i=2; i<=n; i++)
		{
			if (pnt[i].y==pnt[i-1].y)
			{
				left[pnt[i].id] = left[pnt[i-1].id]+1;
			}
			else
			{
				num++;
			}
			if (pnt[n-i+1].y == pnt[n-i+2].y)
			{
				large[pnt[n-i+1].id] = large[pnt[n-i+2].id];
				right[pnt[n-i+1].id] = right[pnt[n-i+2].id]+1;
			}
			else
			{
				large[pnt[n-i+1].id] = i-1;
			}
			pnty[pnt[i].id] = num;
		}
		sort(pnt+1, pnt+n+1, cmpx);
		for (i=2; i<=n; i++)
		{
			if (pnt[i].x==pnt[i-1].x)
			{
				down[pnt[i].id] = down[pnt[i-1].id]+1;
			}
			if (pnt[n-i+1].x == pnt[n-i+2].x)
			{
				up[pnt[n-i+1].id] = up[pnt[n-i+2].id]+1;
			}
		}
		int base = 1;
		int omax = 0, smin;
		for (i=1; i<=n; )
		{
			omax= -1;
			while (i<=n && pnt[i].x == pnt[base].x)
			{
				bl = getsum(pnty[pnt[i].id]-1);
				bl -= down[pnt[i].id];
				update(pnty[pnt[i].id], 1);
                tl = i - 1 - left[pnt[i].id] - bl - down[pnt[i].id];  
                tr = large[pnt[i].id] - tl - up[pnt[i].id];  
                br = n - 1 - bl - tl - tr - right[pnt[i].id] - left[pnt[i].id] - up[pnt[i].id] - down[pnt[i].id];
               /// printf("%d    %d %d %d %d\n", pnt[i].id, br, tl, tr, bl);
                if (br + tl > omax)
                {
					omax = br + tl;
					smin = bl + tr;
				}
				else if (br + tl == omax)
				{
					smin = min(bl + tr, smin);
				}
				i++;		
			}
			if (smin > anss)
			{
				anss = smin;
				anso.clear();
				anso.insert(omax);
			}
			else if (smin == anss)
			{
				anso.insert(omax);
			}
			base = i;
		}
		set<int>::iterator id;
		printf("Stan: %d; Ollie:", anss);
		for (id = anso.begin(); id!=anso.end(); id++)
		{
			printf(" %d", *id);
		}
		puts(";");
	}
}

2、uva 11610 - Reverse Prime

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=78&problem=2657&mosmsg=Submission+received+with+ID+7313177

数学很弱，参考了好几篇博客。但是这里用的数学知识都很基础，受益匪浅。各种优化。。。。其实和前几个博客的题目很相似，用到了二分求第k大数，这里也使用了map

不得不说STL很强大

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <map>
using namespace std;
#define DEBUGE 0
const int MAX = 1000000+10;
bool flag[MAX];
int reverse_prime[MAX], num, prime[MAX];
int c1[MAX], c2[MAX];
int b[MAX];
map<int, int> mapii;
int chang(int x)
{
	int t = 0, y = 0;
	while (x)
	{
		t++;
		y = y * 10 + x % 10;
		x = x / 10;
	}
	while (t < 6)
	{
		y = y * 10;
		t++;
	}
	return y;
}
int cal(int x)
{
	int i, ans = 2;
	for (i=1; i<=num&&prime[i] * prime[i]<=x; i++)
	{
		while (x%prime[i] == 0)
		{
			ans++;
			x /= prime[i];
		}
	}
	if (x > 1)
	{
		ans++;
	}
	return ans;
}

int lowbit(int x)
{
	return x&(-x);
}
void update(int x, int v, int type)
{
	while (x<num+10)
	{
		if (type == 1)
		{
			c1[x] += v;
		}
		else
		{
			c2[x] += v;
		}
		x += lowbit(x);
	}
}

int getsum(int x, int type)
{
	int sum = 0;
	while (x)
	{
		if (type == 1)
		{
			sum += c1[x];
		}
		else
		{
			sum += c2[x];
		}
		x -= lowbit(x);
	}
	return sum;
}

int find(int x)
{
	int l = 1, r = num, mid;
	while (l<r)
	{
		mid = (l + r) / 2;
		if (getsum(mid, 1) < x)
		{
			l = mid + 1;
		}
		else
		{
			r = mid;
		}
	}
	return r;
}
void init()
{
	memset(flag, true, sizeof(flag));
	memset(b, 0, sizeof(b));
	memset(c1, 0, sizeof(c1));
	memset(c2, 0, sizeof(c2));
	int i, j;
	num = 0;
	for (i=3; i*i<1000000; i+=2)
	{
		for (j=i; j*i<1000000; j+=2)
		{
			flag[i*j] = false;
		}
	}
	reverse_prime[++num] = 200000;
	prime[num] = 2;
	for (i=3; i<1000000; i+=2)
	{
		if (flag[i])
		{
			reverse_prime[++num] = chang(i);
			prime[num] = i;
		}
	}
	
	sort(reverse_prime + 1, reverse_prime+num+1);
	for (i=1; i<=num; i++)
	{
		//printf("%d\n", reverse_prime[i]);
		mapii[reverse_prime[i]] = i;
		b[i] = cal(reverse_prime[i]);
		update(i, 1, 1);
		update(i, b[i], 2);
	}
	//printf("%d\n", reverse_prime[1]);
}
int main()
{
	init();
	int x;
	char ins;
	while (scanf("%c %d", &ins, &x) == 2)
	{
		//printf("%d\n", mapii[x/10]);
		getchar();
		x++;
		if (ins == 'q')
		{
			printf("%d\n", getsum(find(x), 2));
		}
		else
		{
			update(mapii[x/10], -1, 1);
			update(mapii[x/10], -b[mapii[x/10]], 2);
		}
	}
	return 0;
}
/*
q 0
q 1
q 2
d 1000070
d 1000090
q 0
d 1000240
q 0
q 1
*/