1.LCS(最长上升子序列)
#include<cstdio>
#include<iostream>
using namespace std;
const int maxn = 5000 + 7;
int a[maxn],b[maxn],n,dp[maxn][maxn];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",a+i);
for(int i=1;i<=n;i++)scanf("%d",b+i);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(a[i] != b[j])dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
else dp[i][j