【Poj】2464 （线段树）

题目：平面上有若干个点，stan过其中某个点划一条垂直x轴的线（可同时过多个点），ollie过stan画的线中的某个点，画一条垂直与y轴的线，这时候将平面分为4个区域，stan的得分为第一象限和第三象限的个数，olle反之。

现在题目的要求来了，有点绕：题目要求在stan画下的一条直线之后，ollie可以获得的最高分，stan获得一个分数x，最后x最大的时候，将ollie的分数输出。

思路就不会说了，做了这么久的线段树，感觉自己依然渣。没思路。

大神博客：

http://hi.baidu.com/czyuan_acm/item/915764070c200393a3df43db

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>
using namespace std;
#define MAX 200005
#define lowbit(x) (x&(-x))
int up[MAX], down[MAX], upy[MAX], l[MAX], r[MAX], sum[MAX], id[MAX];

struct node
{
	int x, y;
	int id;
}p[MAX];

bool cmp1(node a, node b)
{
	if (a.x == b.x)
		return a.y < b.y;
	return a.x < b.x;
}

bool cmp2(node a, node b)
{
	if (a.y == b.y)
		return a.x < b.x;
	return a.y < b.y;
}

void updata(int x)
{
	for (int i = x; i < MAX; i += lowbit(i))
		sum[i]++;
}

int getsum(int x)
{
	int ans = 0;
	for (int i = x; i > 0; i -= lowbit(i))
		ans += sum[i];
	return ans;
}

void init()
{
	memset(sum, 0, sizeof(sum));
	memset(up, 0, sizeof(up));
	memset(down, 0, sizeof(down));
	memset(upy, 0, sizeof(upy));
	memset(l, 0, sizeof(l));
	memset(id, 0, sizeof(id));
	memset(r, 0, sizeof(r));
}
int main()
{
	int n;
	while (~scanf("%d", &n),n)
	{
		int x, y;
		for (int i = 0; i < n; i++)
		{
			scanf("%d%d", &x, &y);
			p[i].x = x;
			p[i].y = y;
			p[i].id = i;
		}
		init();
		sort(p, p + n, cmp2);
		for (int i = 1; i < n; i++)
		{
			if (p[i].y == p[i - 1].y)
				down[p[i].id] = down[p[i - 1].id] + 1;
			if (p[n - i - 1].y == p[n - i].y)
			{
				up[p[n - i - 1].id] = up[p[n - i].id] + 1;
				upy[p[n - 1 - i].id] = upy[p[n - i].id];
			}
			else
				upy[p[n - 1 - i].id] = i;
		}

		int cnt = 1;
		id[p[0].id] = cnt;
		for (int i = 1; i < n; i++)
		if (p[i].y == p[i - 1].y)
			id[p[i].id] = cnt;
		else
			id[p[i].id] = ++cnt;
		sort(p, p + n, cmp1);

		for (int i = 1; i < n; i++)
		{
			if (p[i].x == p[i - 1].x)
				l[p[i].id] = l[p[i - 1].id] + 1;
			if (p[n - i - 1].x == p[n - i].x)
				r[p[n - i - 1].id] = r[p[n - i].id] + 1;
		}
		set<int>res;
		int stan, ollie, ma = 0;
		int bl, br, tl, tr;
		int omax, smax;
		int cur;
		int tx = p[0].x;
		for (int i = 0; i < n; i++)
		{
			cur = p[i].id;
			omax = -1;
			stan = -1;
			while (i<n&&tx == p[i].x)
			{
				int s = getsum(id[cur]);
				updata(id[cur]);
				bl = s - l[cur] - down[cur];
				tl = i - s;
				tr = upy[cur] - tl - r[cur];
				br = n - bl - tl - tr - up[cur] - down[cur] - l[cur] - r[cur] - 1;
				ollie = tl + br;
				if (ollie>omax){ omax = ollie; stan = bl + tr; }
				else
				if (ollie == omax){ stan = min(stan, bl + tr); }
				i++;
				cur = p[i].id;
			}
			if (i<n)tx = p[i--].x;
			if (stan > ma)
			{
				res.clear();
				res.insert(omax);
				ma = stan;
			}
			else
			if (stan==ma)
				res.insert(omax);
		}
		cout << "Stan: " << ma << "; Ollie:";
		set<int>::iterator i = res.begin();
		for (i; i != res.end(); i++)
			printf(" %d", *i);
		puts(";");
	}
}