Prince and Princess
UVA - 10635题意:给出两个数串, 求出最长公共子序列(LCS);
直接求LCS, O(n^2)的复杂度, 超时;
题目说明, 数列中不会出现相同的数, 转换下思想, 将每个数标上对应数串1中顺序编号, 然后求数串2的LIS, O(nlogn)算法;
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
const int maxn=100100;
int a[70000], b[70000], num[70000], s[70000], dp[70000];
vector<int> vec;
int main(){
int t, n, p, q, ca=0;
scanf("%d", &t);
while(t--){
vec.clear();
ca++;
memset(num, 0, sizeof(num));
scanf("%d%d%d", &n, &p, &q);
for(int i=1; i<=p+1; i++){
scanf("%d", &a[i]);
num[a[i]]=i;
}
for(int i=1; i<=q+1; i++){
scanf("%d", &b[i]);
s[i]=num[b[i]];
}
memset(dp, 0, sizeof(dp));
int ans=0;
for(int i=1; i<=q+1; i++){
if(s[i]==0) continue;//注意要把没有出现在数串1中的数去掉;
if(vec.size()==0){
vec.push_back(s[i]);
dp[i]=1;
continue;
}
if(s[i]>vec[vec.size()-1]){
vec.push_back(s[i]);
dp[i]=vec.size();
continue;
}
int left=0, right=vec.size()-1;
while(left<right){
int mid=(left+right)>>1;
if(s[i]<=vec[mid]) right=mid;
else left=mid+1;
}
dp[i]=right+1;
if(s[i]!=vec[right]) vec[right]=s[i];
}
for(int i=1; i<=q+1; i++){
ans=max(ans, dp[i]);
}
printf("Case %d: %d\n", ca, ans);
}
return 0;
}