SPOJ-LIS2[又遇CDQ]

SPOJ - LIS2 Another Longest Increasing Subsequence Problem Time Limit: 345MS   Memory Limit: 1572864KB   64bit IO Format: %lld & %llu Submit Status Description Given a sequence of N pairs of integers, find the length of the longest increasing subsequence of it. An increasing sequence A1..An is a sequence such that for every i < j, Ai < Aj. A subsequence of a sequence is a sequence that appears in the same relative order, but not necessarily contiguous. A pair of integers (x1, y1) is less than (x2, y2) iff x1 < x2 and y1 < y2. Input The first line of input contains an integer N (2 ≤ N ≤ 100000). The following N lines consist of N pairs of integers (xi, yi) (-109 ≤ xi, yi ≤ 109). Output The output contains an integer: the length of the longest increasing subsequence of the given sequence. Example Input: 8 1 3 3 2 1 1 4 5 6 3 9 9 8 7 7 6 Output: 3

题意，给定不能排序的二维点对，求最长严格上升子序列。

习惯了三维偏序，于是强制加了一维编号，把编号当成x,于是就成了裸的3维偏序，CDQ分治一下就好了。

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<cmath>
using namespace std;
const int maxn=100000+20;
struct xnode
{
	int x,y,z;
}q[maxn],tr[maxn],tl[maxn];
int f[maxn];
bool cmpx(xnode a,xnode b)
{
	if(a.x!=b.x)return a.x<b.x;
	if(a.y!=b.y)return a.y<b.y;
	return a.z<b.z;
}
bool cmpy(xnode a,xnode b)
{
	if(a.y!=b.y)return a.y<b.y;
	return a.z<b.z;
}
int tot;
int det[maxn];
int g[maxn];
int n;
void updata(int x,int v)
{
	while(x<=tot)
	{
		g[x]=max(g[x],v);
		x+=x&-x;
	}
}
void clear(int x)
{
	while(x<=tot)
	{
		g[x]=0;
		x+=x&-x;
	}
}
int query(int x)
{
	int ans=0;
	while(x)
	{
		ans=max(ans,g[x]);
		x-=x&-x;
	}
	return ans;
}
int find(int x)
{
	return lower_bound(det+1,det+tot+1,x)-det;
}
void work(int l,int r)
{
	int mid=(l+r)>>1;
	int t1,t2;
	t1=t2=0;
	for(int i=l;i<=mid;i++)tl[++t1]=q[i];
	for(int i=mid+1;i<=r;i++)tr[++t2]=q[i];
	sort(tl+1,tl+t1+1,cmpy);
	sort(tr+1,tr+t2+1,cmpy);
	for(int i=1,j=1;j<=t2;j++)
	{
		for(;i<=t1&&tl[i].y<tr[j].y;i++)
		{
			updata(tl[i].z,f[tl[i].x]);
		}
		f[tr[j].x]=max(query(tr[j].z-1)+1,f[tr[j].x]);
	}
	for(int i=l;i<=mid;i++)clear(q[i].z);
}
void cal(int l,int r)
{
	if(l==r)return ;
	int mid=(l+r)>>1;
	cal(l,mid);
	work(l,r);
	cal(mid+1,r);
}
int main()
{
	while(scanf("%d",&n)!=EOF)
	{
		tot=0;
		for(int i=1;i<=n;i++)
		{
			q[i].x=i;
			f[i]=1;
			scanf("%d%d",&q[i].y,&q[i].z);
			det[++tot]=q[i].z;
		}
		sort(det+1,det+tot+1);
		int t=tot;
		tot=unique(det+1,det+t+1)-det-1;
		for(int i=1;i<=n;i++)q[i].z=find(q[i].z);
		sort(q+1,q+n+1,cmpx);
		cal(1,n);
		int ans=0;
		for(int i=1;i<=n;i++)ans=max(ans,f[i]);
		printf("%d\n",ans);
	}
	return 0;
}