https://www.luogu.org/problem/P5464
dp(60分)
f[i][j]表示当前选第i个上一个选的是第j个
//luogu 5464 60分算法
#include<iostream>
#include<algorithm>
#define ll long long
#define f(i,l,r) for(i=(l);i<=(r);i++)
using namespace std;
const int MAXN=2005,MOD=1e9+7;
int n;
struct Node{
int x,y;
bool operator < (const Node& tmp)const{
return y<tmp.y;
}
}a[MAXN];
ll dp[MAXN][MAXN];
ll ans;
int main()
{
int i,j,k;
cin>>n;
f(i,1,n){
cin>>a[i].x>>a[i].y;
}
sort(a+1,a+1+n);
f(i,1,n){
dp[i][0]=1;
ans++;
f(j,1,i-1){
if(a[j].y<a[i].x) continue;
if(a[j].x<a[i].x){
f(k,0,j-1){
if(a[k].y>=a[i].x) continue;
dp[i][j]+=dp[j][k];
dp[i][j]%=MOD;
}
}
else{
f(k,0,j-1){
if(a[k].y>=a[j].x) continue;
dp[i][j]+=dp[i][k];
dp[i][j]%=MOD;
}
}
ans=(ans+dp[i][j])%MOD;
}
}
cout<<a