LIS 求 LCS 方法全 WA 求调

#include <bits/stdc++.h>
//#define int long long
using namespace std;
const int N = (int)1e5 + 5;
const int INF = (int)1e18;

int n, len, p1[N], p2[N], id[N], dp[N];

signed main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)	{scanf("%d", &p1[i]); id[p1[i]] = i;}
	for (int i = 1; i <= n; i++)	{scanf("%d", &p2[i]); p2[i] = id[p2[i]];}
//	for (int i = 1; i <= n; i++)	printf("%lld ", p2[i]);
	dp[0] = -INF;
	for (int i = 1; i <= n; i++) {
		if (p2[i] >= dp[len])	dp[++len] = p2[i];
		else {
			int pos = lower_bound(dp + 1, dp + 1 + len, p2[i]) - dp;
			dp[pos] = p2[i];
		}
	}
	printf("%d", len);
	return 0;
}