AC情况:
代码:
#include <iostream>
#include <cstdio>
using namespace std;
int rect[1005][2];
int db[1005];
int n;
int sc(int x){
int num=0;
for(int i=0;i<n;i++){
if(rect[i][1]<rect[x][1]&&rect[i][0]<rect[x][0]){
if(db[i]){
if(db[i]>num)num=db[i];
}else{
if(sc(i)>num)num=db[i];
}
}
}
db[x]=num+1;
return db[x];
}
int main(){
int N;
scanf("%d",&N);
while(N--){
int res=0;
scanf("%d",&n);
for(int i=0;i<n;i++){
db[i]=0;
int a,b;
scanf("%d%d",&a,&b);
if(a>b){
rect[i][0]=a;
rect[i][1]=b;
}else{
rect[i][0]=b;
rect[i][1]=a;
}
}
for(int i=0;i<n;i++){
if(!db[i])sc(i);
if(db[i]>res)res=db[i];
}
printf("%d\n",res);
}
return 0;
}
这题做起来比想象中容易点,,