转载自该博客:http://blog.csdn.net/geniusluzh/article/details/6768329
#include<iostream>
#include<algorithm>using namespace std;
struct NODE
{
int l;
int r;
}blocks[10010];
int dp[110][110];
int main()
{
int n,ans;
while(cin>>n&&n)
{
memset(dp,0,sizeof(dp));
for(int i=0;i<n;i++)
{
cin>>blocks[i].l;
cin>>blocks[i].r;
dp[blocks[i].l][blocks[i].r]++;
}
for(int i=1;i<=100;i++)
{
for(int j=1;j<=100;j++)
{
dp[i][j]+=max(dp[i-1][j],dp[i][j-1]);
}
}
int ans=0;
for(int i=0;i<n;i++)
{
if(dp[blocks[i].l][blocks[i].r]>ans)
ans=dp[blocks[i].l][blocks[i].r];
}
cout<<ans<<endl;
}
cout<<endl;
return 0;
}