UVA - 10635 Prince and Princess 最长上升子序列

转化为最长上升子序列问题

#include<bits/stdc++.h>
using namespace std;
const int maxn = 9e4 + 7, maxd = 3000 + 7;;
typedef long long ll;
const int INF = 0x3f3f3f3f;

int n, p, q;
map<int, int> mp;
int a[maxn], b[maxn], c[maxn];

int main() {
    int T, id = 0; scanf("%d", &T);
    while(T--) {
        id++;
        scanf("%d%d%d", &n, &p, &q);
        for(int i = 0; i <= p; ++i) { scanf("%d", &a[i]); mp[a[i]] = i;}
        for(int i = 0; i <= q; ++i) { scanf("%d", &b[i]); b[i] = mp[b[i]];}
        memset(c, INF, sizeof c);
        for(int i = 0; i <= q; ++i) {
            *lower_bound(c, c+maxn, b[i]) = b[i];
        }
        printf("Case %d: %d\n", id, (lower_bound(c,c+maxn, INF)-c));
    }
    return 0;
}