题意
给你两个5*n字符串,且字符串的构成是1~n每个数字各出现5次
问你最长公共子序列
题解
考虑到每个数只有5个。。
那么一个数能匹配的地方就只有5个,然后暴力DP一下就好了
CODE:
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const int N=20005*5;
int f[N][6];
int a[N],b[N];
int g[N][6];//位置
int n;
int h[N];
int lb (int x){return x&(-x);}
int mymax (int x,int y){return x>y?x:y;}
void add (int x,int y)
{
while (x<=n)
{
h[x]=mymax(h[x],y);
x+=lb(x);
}
}
int get (int x)
{
int ooo=0;
while (x>=1)
{
ooo=mymax(ooo,h[x]);
x-=lb(x);
}
return ooo;
}
int main()
{
memset(g,-1,sizeof(g));
scanf("%d",&n);n*=5;
for (int u=1;u<=n;u++) scanf("%d",&a[u]);
for (int u=1;u<=n;u++)
{
scanf("%d",&b[u]);
for (int i=1;i<=5;i++)
if (g[b[u]][i]==-1)
{
g[b[u]][i]=u;
break;
}
}
int ans=0;
for (int u=1;u<=n;u++)
{
for (int i=5;i>=1;i--)//和第几个匹配
{
f[u][i]=mymax(f[u][i],get(g[a[u]][i]-1)+1);
add(g[a[u]][i],f[u][i]);
}
ans=mymax(ans,f[u][5]);
}
printf("%d\n",ans);
return 0;
}