#include<iostream>
#include<cstdio>
#include<algorithm>
#include<iomanip>
using namespace std;
struct node
{
int east,west;
};
node a[5100];
int d[5100];
bool cmp(node c,node d)
{
return c.east<d.east;
}
int main()
{
int n;
scanf("%d",&n);
int i,x,len=1;
for(i=1;i<=n;i++)
scanf("%d%d",&a[i].east,&a[i].west);
d[1]=a[1].west;
sort(a+1,a+n+1,cmp);
for(i=2;i<=n;i++)
{
x=upper_bound(d+1,d+len+1,a[i].west)-d;
d[x]=a[i].west;
if(x>len)len++;
}
cout<<len<<endl;
return 0;
}
1263:【例9.7】友好城市
最新推荐文章于 2024-02-14 20:46:13 发布