O(nlogn)最长上升子序列

NOIP 1999 导弹拦截：

#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#define maxn 5005
using namespace std;

int h[2][maxn],n=0,seq[maxn],len;

int main()
{
	for(n=0;~scanf("%d",&h[1][n]);n++) h[0][n]=30001-h[1][n];
	for(int typ=0;typ<2;typ++)
	{
		len=0;
		for(int i=0;i<n;i++)
			if(!len || h[typ][i]>seq[len-1]) seq[len++]=h[typ][i];
			else *lower_bound(seq,seq+len,h[typ][i])=h[typ][i];
		printf("%d\n",len);
	}
}

更有普遍性的方法是使用树状数组维护二维偏序

#include<bits/stdc++.h>
#define maxn 200005
using namespace std;

inline void read(int &res){ char ch;for(;!isdigit(ch=getchar()););for(res=ch-'0';isdigit(ch=getchar());res=res*10+ch-'0'); }
int n,k,a[maxn],b[maxn],len;
int f[maxn];

int t[maxn];
void upd(int now,int val){ for(;now<=len;now+=now &-now) t[now]=max(t[now],val); }
int query(int now){ int ret=0;for(;now;now-=now & -now) ret = max(ret,t[now]); return ret; }

int cal(int n)
{
	for(int i=1;i<=n;i++)
	{
		f[i] = query(a[i]-1) + 1;
		upd(a[i],f[i]);
	}
	return f[n];
}

int main()
{
	read(n),read(k);
	for(int i=1;i<=n;i++)
		read(a[i]),b[i]=a[i];
	sort(b+1,b+1+n);
	len = unique(b+1,b+1+n)-b-1;
	for(int i=1;i<=n;i++) a[i] = lower_bound(b+1,b+1+len,a[i]) - b;
	
	int tmp = cal(k);
	memset(t,0,sizeof t);
	
	for(int i=1;i<=n-i+1;i++) swap(a[i] , a[n-i+1]);
	for(int i=1;i<=n;i++) a[i] = len - a[i] + 1;
		
	printf("%d\n",cal(n-k+1) + tmp - 1);
}