UVA 10635 Prince and Princess

把最長公用子串問題轉換成最長遞增子串問題然後用nlogn的方法去求解最長遞增子串問題，整個題目就解出來了。

#include <stdio.h>#include <algorithm>#include <map>using namespace std;typedef int NUMBER;typedef int INDEX;map<NUMBER, INDEX> m;#defineINF0x7fffffffint arr[62505];int g[63505];void func(int len){static int case_n = 1;int i, p, max_len;for(i=1; i<=len; i++)g[i] = INF;max_len = -1;for(i=1; i<=len; i++){p = lower_bound(g+1, g+i, arr[i])-g;if(max_len < p)max_len = p;g[p] = arr[i];}printf("Case %d: %d\n", case_n++, max_len);}int main(void){int t, n, p, q, i, num;//freopen("input.dat", "r", stdin);scanf("%d", &t);while(t--){scanf("%d %d %d", &n, &p, &q);for(i=1; i<=p+1; i++){scanf("%d", &num);m[num] = i;}for(i=1; i<=q+1; i++){scanf("%d", &num);arr[i] = m[num];}func(q+1);}return 0;}