jzoj 3945. 【湖南省队集训2014】Jabberwocky 树状数组

Description

Input

Output

Sample Input
1
10 3
1 2 3
2 1 1
2 4 2
3 5 3
4 4 2
5 1 2
6 3 1
6 7 1
7 2 3
9 4 2
Sample Output
5

Data Constraint

分析：显然可以枚举不包含那种颜色。使用树状数组，线段树，询问一个区间内点的个数，再枚举线段高度，我们先考虑取的是下方的，高度从上面枚举，到下方后往左右两边扩展，每个点可以用双向链表存储前一个和后一个同颜色的点。这个多组数据有点坑。

代码：

#include <iostream> 
#include <cstdio>
#include <cstring>
#include <algorithm>
#define memcle(a) memset(a, sizeof(a), 0)
using namespace std;
typedef long long ll;
const int N = 110000;
const ll inf = 4294967295LL;
int next[N], prev[N], num[N], Tree[N];
ll tmp[N];
bool bz[N];
int n, m, ans, T;

struct Point {ll x, y;int c;} a[N];
bool cmpc(Point x, Point y) {return (x.c == y.c) ? x.x < y.x : x.c < y.c;}
bool cmpy(int x, int y) {return a[x].y > a[y].y;}

void Ins(int x, int d) {for (; x <= n; x += (x & -x)) Tree[x] += d;}
int Cnt(int x) {int ret = 0; for (; x; x -= (x & -x)) ret += Tree[x]; return ret;}

void Work() {
	memcle(next); memcle(prev); memcle(Tree);
	sort(a + 1, a + 1 + n, cmpc);
	for (int i = 1; i <= n; i++) Ins(a[i].x, 1);
	
	for (int i = 1; i <= n; i++) {
		int j = i;
		for (; a[j].c == a[j + 1].c; j++);
		for (int k = i; k <= j; k++) next[k] = k + 1, prev[k] = k - 1;
		prev[i] = next[j] = 0;
		
		for (int k = i; k <= j; k++) {
			int l = (prev[k]) ? a[prev[k]].x + 1 : 1;
			if (l > a[k].x) continue;
			ans = max(ans, Cnt(a[k].x - 1) - Cnt(l - 1));
		}
		ans = max(ans, Cnt(n) - Cnt(a[j].x));
		i = j;
	}
	
	for (int i = 1; i <= n; i++) num[i] = i;
	sort(num + 1, num + 1 + n, cmpy);
	
	int j = 1;
	for (int i = 1; i <= n; i++) {
		int x = num[i];
		for (; j <= n && a[num[j]].y >= a[x].y; j++) Ins(a[num[j]].x, -1);
		int l = (prev[x]) ? a[prev[x]].x + 1 : 1;
		int r = (next[x]) ? a[next[x]].x - 1 : n;
		if (l > a[x].x || r < a[x].x) continue;		
		if (prev[x]) next[prev[x]] = next[x];
		if (next[x]) prev[next[x]] = prev[x];
		ans = max(ans, Cnt(r) - Cnt(l - 1));
	}
}

int main() {
	scanf("%d", &T);
	for (; T; T--) {
		ans = 0;
		scanf("%d%d", &n, &m);
		memcle(bz);
		ll ma = -inf;
		for (int i = 1; i <= n; i++) scanf("%lld%lld%d", &a[i].x, &a[i].y, &a[i].c), tmp[i] = a[i].x, ma = max(a[i].y, ma);
		sort(tmp + 1, tmp + 1 + n);
		int tn = unique(tmp + 1, tmp + 1 + n) - tmp;
		for (int i = 1; i <= n; i++) a[i].x = lower_bound(tmp + 1, tmp + tn, a[i].x) - tmp;
		for (int i = 1; i <= n; i++) bz[a[i].c] = 1;
		for (int i = 1; i <= m; i++) if (!bz[i]) ans = n;
		Work();
		for (int i = 1; i <= n; i++) a[i].y = ma - a[i].y + 1;
		Work();
		printf("%d\n", ans);
	}
	return 0;
}