#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
struct node
{
int x;
int y;
}s[500005];
int rm[500005];
bool cmp( node a, node b )
{
return a.x<b.x;
}
int Find( int x, int n )
{
int L, R, Mid;
L=0;R=n;
while( L<=R )
{
Mid=( L+R )/2;
if( x>rm[Mid] )
L=Mid+1;
else if( x<rm[Mid] )
R=Mid-1;
else
return Mid;
}
return L;
}
int main()
{
int i, j, cas=0;
int n;
while( scanf( "%d", &n )!=-1 )
{
memset( dp, 0, sizeof( dp ) );
for( i=0;i<n;i++ )
scanf( "%d%d", &s[i].x, &s[i].y );
sort( s, s+n, cmp );
dp[0]=1;
rm[0]=-1;
rm[1]=s[0].y;
for( i=1;i<n;i++ )
{
rm[i+1]=1e10;
int index=Find( s[i].y, i+1 );
rm[index]=s[i].y;
dp[i]=index;
}
int Max=0;
for( i=0;i<n;i++ )
if( dp[i]>Max )
Max=dp[i];
printf( "Case %d:\n", ++cas );
if( Max==1 )
printf( "My king, at most %d road can be built.\n", Max );
else
printf( "My king, at most %d roads can be built.\n", Max );
printf( "\n" );
}
return 0;
}
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
int A[500005];
int B[500005];
int Find( int x, int n )
{
int L, R, Mid;
L=1;R=n;
while( L<=R )
{
Mid=( L+R )/2;
if( x>B[Mid] )
L=Mid+1;
else if( x<B[Mid] )
R=Mid-1;
else
return Mid; // 如果是最长不递减子序列 Mid+1
}
return L;
}
int main()
{
int i, j, cas=0;
int n, x, y, index;
while( scanf( "%d", &n )!=-1 )
{
for( i=0;i<n;i++ )
{
scanf( "%d%d", &x, &y );
A[x]=y;
}
int Max=1;
B[1]=A[1];
for( i=2;i<=n;i++ )
{
B[i]=1e10;
index=Find( A[i], i );
B[index]=A[i];
Max=max( Max, index );
}
printf( "Case %d:\n", ++cas );
if( Max==1 )
printf( "My king, at most %d road can be built.\n", Max );
else
printf( "My king, at most %d roads can be built.\n", Max );
printf( "\n" );
}
return 0;
}