uva 10635

LCS轉換成LIS

因為都是單一數字，否則LCS算法太慢

//============================================================================
// Name        : Prince and Princess.cpp
// Date : 2013/4/16 下午1:08:42
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 250*250+2
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}

int n1,n2,n;
int x[M],y[M];
int rx[M];
int ry[M];
int dp[M];
int lower(int x){
    int h=n2,l=0;
    while(h>l){
        int mid=(h+l)>>1;
        if(x>dp[mid]){
            l=mid+1;
        }else{
            h=mid;
        }
    }
    return l;
}
int main() {
    ios_base::sync_with_stdio(0);
    int test;
    scanf("%d",&test);
    int ff=0;
    while(test--){
        fill(&dp[0],&dp[M-1],oo);
        Set(rx,-1);
        scanf("%d%d%d",&n,&n1,&n2);
        for(int i=0;i<=n1;i++){
            scanf("%d",&x[i]);
            rx[x[i]]=i;
        }
        for(int i=0;i<=n2;i++){
            scanf("%d",&y[i]);
        }
        for(int i=0;i<=n2;i++){
            ry[i]=rx[y[i]];
        }
        for(int i=0;i<=n2;i++){
            if(ry[i]==-1)continue;
            int k=lower(ry[i]);
            dp[k]=ry[i];
        }
//        for(int i=0;i<=n2;i++){
//            printf("%d ",dp[i]);
//        }Pln();
        int ans=0;
        for(int i=0;dp[i]!=oo;i++)ans++;
        printf("Case %d: %d\n",++ff,ans);
    }


}