把A序列按1~p+1顺序重新编号,A原序列与现在序列会存在一个映射关系,由此来修改B序列。
B序列为0的元素代表改元素在A中未出现,
如A = {1,7, 5,4,8,3,9},B = {1,4,3,5,6,2,8,9}A‘ = {1,2,3,4,5,6,7};故 7->2,5->3,4->4,8->5,3->6,9->7,
由此得到B' = {1,4,6,3,0,0,5,7};之后求B的LIS
/******************
* Author:fisty
* Data:2014-10-21
* uva10635
* dp LIS
********************/
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define MAX_N 250 * 250
#define INF 1000000000
int s[MAX_N], g[MAX_N],d[MAX_N];
int num[MAX_N];//num[x] 为x的新编号
int solve_LIS(int n){
int dp[MAX_N];
fill(dp, dp + n, INF);
for(int i = 0;i < n; i++){
*lower_bound(dp, dp + n, s[i]) = s[i];
}
return lower_bound(dp, dp + n, INF) - dp;
}
int main(){
int t;
int cnt = 1;
scanf("%d", &t);
while(t--){
int N,p,q,x;
scanf("%d%d%d", &N, &p, &q);
memset(num, 0, sizeof(num));
for(int i = 1;i <= p + 1; i++){
scanf("%d", &x);
num[x] = i; //把x映射
}
int n = 0;
for(int i = 0;i < q+1; i++){
scanf("%d", &x);
if(num[x]) s[n++] = num[x];
}
//LIS
int ans = solve_LIS(n);
printf("Case %d: %d\n",cnt++,ans);
}
return 0;
}