HDU 1025 dp

2014/9/28

hdu输出换行不按常理出牌？QAQ

//Ñô1a'ìí'Ë«íø
#include<stdio.h>
#include<string.h>
#include<cmath> 
#include<algorithm>
#include<iostream>
#include<queue>
#include<stack>
#include<map>
#include<climits>
#include<vector>

using namespace std;
typedef long long ll;  
#define f(x,y,i) for(int i = x;i < y; i++)
#define ff(x,y,i) for(int i = x;i  <= y; i++)
#define F(x,y,i) for(int i = x; i >= y; i--)
#define FF(x,y,i) for(int i = x; i > y; i++)
#define lson pos<<1,l,mid
#define rson pos<<1|1,mid+1,r
#define sc(n) scanf("%d",&n)
#define pr(n) printf("%d\n",n)
#define met(n,m) memset(n, m, sizeof(n)) 
#define mod 10007
const int inf = INT_MAX;
const int N=500500;

int Max(int a,int b)
{
    return a>b?a:b;
}

int Min(int a,int b)
{
    return  a<b?a:b;
}

struct node{
    int v;
    int w;
}ss[N];

bool cmp(node a,node b)
{
    if(a.w != b.w)return a.w < b.w;
    else return a.v < b.v;
}


int vis[N]; 
int dp[N];


int main()
{
    int n;
    int cnt = 0;
    while(~scanf("%d",&n))
    {
        int maxn = 1;
        f(0,n,i)
        scanf("%d%d",&ss[i].w,&ss[i].v);
        
        
        sort(ss,ss+n,cmp);
        dp[1] =ss[0].v ;
    
        f(1 ,n, i)
        {
            int low = 1;
            int high = maxn;
            while(low <= high)
            {
                int mid = (low + high)/2;
                if(ss[i].v > dp[mid])
                low = mid + 1;
                else high = mid - 1;
            }
            
            dp[low] = ss[i].v;
            maxn = Max(maxn,low);
        }
        
        
        //if(cnt)printf("\n");
        printf("Case %d:\n",++cnt);
        if(maxn == 1)
        printf("My king, at most %d road can be built.\n",maxn);
        else
            printf("My king, at most %d roads can be built.\n",maxn);
        printf("\n");
    }
    
    
   
  return 0;
}