Description
给出一个原始串和目标串,要求在原始串上不停的把后面的字符移动到前面去,用最少的步数使两串相同。
n<=2000
Solution
用DP:
fi,j
表示目标串匹配到了i,原始串匹配到了j,
那么当前有两种选择:
1. 如果两位置字符相同,则直接匹配;
2. 当前这位的目标串然后面的来匹配,先跳过;
3. 当前这位的原始串去匹配前面跳过的目标串(当前要有的跳才行)
直接DP即可;
复杂度: O(n2)
Code
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=2050;
int m,n;
int a[N],b[N];
int a1[N][27],b1[N][27];
struct qqww
{
int v,f1,f2,k;
}f[N][N];
int s1[N],s2[N],ad[N];
bool z[N];
qqww min(qqww q,qqww w){return q.v<w.v?q:w;}
void add(int l,int r){fo(i,l,r)ad[i]++;}
int main()
{
freopen("chinese.in","r",stdin);
freopen("chinese.out","w",stdout);
int q,w,_;
scanf("%d",&_);
while(_--)
{
char ch=' ';
while(ch<'a'||ch>'z')ch=getchar();
n=0;
for(;ch<='z'&&ch>='a';ch=getchar())
{
a[++n]=ch-96;
fo(i,1,26)a1[n][i]=a1[n-1][i];
a1[n][a[n]]++;
}
fo(i,1,27)a1[n+1][i]=a1[n][i];
while(ch<'a'||ch>'z')ch=getchar();
q=0;
for(;ch<='z'&&ch>='a';ch=getchar())
{
b[++q]=ch-96;
fo(i,1,26)b1[q][i]=b1[q-1][i];
b1[q][b[q]]++;
}
qqww t;t.v=1e9+1;t.f1=t.f2=t.k=0;
fo(i,1,n+1)fo(j,0,n+1)f[i][j]=t;
f[1][1].v=0;a[n+1]=0;
fo(i,1,n+1)
{
fo(j,1,min(i,n))if(f[i][j].v<1e9)
{
t.f1=i;t.f2=j;
if(a[i]==b[j])
{
t.v=f[i][j].v;t.k=1;
f[i+1][j+1]=min(f[i+1][j+1],t);
}
t.v=f[i][j].v+1;t.k=2;
f[i+1][j]=min(f[i+1][j],t);
if(a1[i-1][b[j]]>=b1[j][b[j]])
{
t.v=f[i][j].v;t.k=3;
if(i==6&&j==2)
{
printf("");
}
f[i][j+1]=min(f[i][j+1],t);
}
}
}
if(f[n+1][n+1].v<1e9)
{
printf("%d\n",f[n+1][n+1].v);
s1[0]=s2[0]=0;
q=n+1,w=n+1;
while(q!=1||w!=1)
{
if(f[q][w].k==2)
{
s1[++s1[0]]=q-1;
}else if(f[q][w].k==3)
{
s2[++s2[0]]=w-1;
}
int q1=q;
q=f[q1][w].f1,w=f[q1][w].f2;
}
fo(i,0,n+1)ad[i]=z[i]=0;
fod(i,s1[0],1)
{
q=0;
fod(j,s2[0],1)if(b[s2[j]]==a[s1[i]]){q=j;break;}
printf("%d %d\n",s2[q]+ad[s2[q]],s1[i]);
z[s2[q]]=1;
for(w=1;w+ad[w]<s1[i]||z[w];w++);
add(w,s2[q]);
s2[q]=0;
}
}else printf("-1\n");
}
return 0;
}