【DP】HDU 1025 Constructing Roads In JGShining's Kingdom 最长上升子序列

  要求不相交，求最长上升子序列

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <set>
#include <vector>
#include <deque>
#include <map>
#define cler(arr, val)    memset(arr, val, sizeof(arr))
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long  LL;
const int MAXN = 100+6;
const int MAXM = 140000;
const int INF = 0x3f3f3f3f;
const int mod = 1000000007;
struct node
{
    int x,y;
}h[500010];
bool cmp(node a,node b)
{
    if(a.x==b.x)
        return a.y<b.y;
    return a.x<b.x;
}
int a[600000];
int main()
{
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
   //  freopen("out.txt", "w", stdout);
#endif
    int n,cas=0;
    while(scanf("%d",&n)!=EOF)
    {
        for(int i=0;i<n;i++)
            scanf("%d%d",&h[i].x,&h[i].y);
        sort(h,h+n,cmp);
        cler(a,0);
        int sum=0;
        a[sum++]=h[0].y;
        for(int i=1;i<n;i++)
        {
            if(a[sum-1]<h[i].y)
            {
                a[sum++]=h[i].y;
                continue;
            }
            int q=lower_bound(a,a+sum,h[i].y)-a;
            a[q]=h[i].y;
        }
        if(sum==1)
            printf("Case %d:\nMy king, at most %d road can be built.\n\n",++cas,sum);
        else
            printf("Case %d:\nMy king, at most %d roads can be built.\n\n",++cas,sum);
    }
    return 0;
}