uva10635 - Prince and Princess

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int N = 90000;

int n, m, k, ha
, a
, dp
;

int main() {
int cas, index = 0;
scanf("%d", &cas);
while (cas--) {
memset(ha, 0, sizeof(ha));
memset(a, 0, sizeof(a));
memset(dp, 0, sizeof(dp));
scanf("%d%d%d", &n, &m, &k);
m++; k++;
int i,cur;
for (i = 1; i <= m; i++) {
scanf("%d", &cur);
ha[cur] = i;
}
for (i = 1; i <= k; i++)
scanf("%d", &a[i]);

int cnt = 0, j;
for (i = 1; i <= k; i++) {
if (!ha[a[i]])//不存在
continue;
int flag = 1;
for (j = 0; j < cnt; j++) {
if (ha[a[i]] < ha[dp[j]]) {
dp[j] = a[i];
flag = 0;
break;
}
}
if (flag)
dp[cnt++] = a[i];

}
printf("Case %d: %d\n", ++index, cnt);
}
return 0;
}