poj1631基于lower_bound的实现

//题意：The call for a computer program that finds the maximum number of signals which may be connected on the silicon surface without crossing each other,
//删除多余的桥段剩下的最多的没有交叉的连接
//
//思路：dp[i]：表示当前结束的时候上升信号中末尾元素的最小值不存在就是INF 类似的最长上升子序列
//

//496K 110MS

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define  INF 40005
int main(){
	int n;
	scanf("%d",&n);
	while(n--){
		int p;
	    scanf("%d",&p);
		vector<int>a;
		vector<int>dp;
		a.resize(p);
		dp.resize(p);
		for (int i=0;i<p;++i)
		  scanf("%d",&a[i]);

		fill(dp.begin(),dp.end(),INF);
		for (int i=0;i<p;++i)
		{
	       *lower_bound(dp.begin(),dp.end(),a[i]) = a[i];
		}

		int ans = lower_bound(dp.begin(),dp.end(),INF)-dp.begin();

		printf("%d\n",ans);
	}

	return 0;
}