Prince and Princess UVA - 10635

映射第二个数列的值为第一个数列的下标

用单调队列维护长度

 #include<bits/stdc++.h>
 using namespace std;
 #define fst first
 #define sec second
 #define sci(num) scanf("%d",&num)
 #define scl(num) scanf("%lld",&num)
 #define mem(a,b) memset(a,b,sizeof a)
 #define cpy(a,b) memcopy(a,b,sizeof b)
 typedef long long LL;
 typedef pair<int,int> P;
 const int MAX_N = 510;
 const int MAX_M = 100000;
 int qs[MAX_M];
 int locs[MAX_M];
 int que[MAX_M],cnt;
 int main() {
     int cs,n,p,q;
     int cntcs = 1;
     sci(cs);
     while (cs--) {
         mem(locs,-1);
         sci(n); sci(p); sci(q);
         for (int i = 1;i <= p + 1;i++) {
             int num;
             sci(num);
             locs[num] = i;
         }
         for (int i = 1;i <= q + 1;i++)
             sci(qs[i]);
         cnt = 0;
         for (int i = 1;i <= q + 1;i++) {
             if (locs[qs[i]] == -1) continue;
             if (cnt == 0 || locs[qs[i]] > que[cnt - 1]) {
                 que[cnt++] = locs[qs[i]];
             } else {
                 int loc = lower_bound(que,que+cnt,locs[qs[i]]) - que;
                 que[loc] = locs[qs[i]];
             }
         }
         printf("Case %d: %d\n",cntcs++,cnt);
     }
     return 0;
 }