题目链接: 点我跳转
题目大意: 一堆木头拥有l,w两个值,必须按照l<=l’&&w<=w’的顺序才能排成一队,求多少组。
题目分析: 可以先按长度从大到小排序,然后在宽度里面只要选择出最长上升子序列就行了(为啥,自行百度偏序定理)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
using namespace std;
int dp[5005];
int lowbound(int a[],int n,int f){
int l = 0,r = n,m;
while(l+1<r){
m = (l+r)>>1;
if(a[m] >= f)r = m;
else l = m;
}
return l;
}
struct node{int l,w;}data[5005];
bool l_cmp(node a,node b){
return a.l>b.l;
}
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>data[i].l>>data[i].w;
sort(data,data+n,l_cmp);
int r = 1;
for(int i=0;i<n;i++){
int w = data[i].w;
int t = lowbound(dp,r,w);
dp[t+1] = data[i].w;
if(t+1 == r)r++;
}
cout<<r-1;
return 0;
}