uva 1625 DP 使得所有相同字母最大距离之和最小

#include<cstdio>#include<cstring>#include<algorithm>using namespace std;char s1[5005],s2[5005];int l1[36],l2[36],r1[36],r2[36];int dp[5005][5005];int main(){int T;scanf("%d",&T); while(T--){scanf("%s%s",s1+1,s2+1);int n=strlen(s1+1);int m=strlen(s2+1);memset(l1,0x3f,sizeof(l1));memset(l2,0x3f,sizeof(l2));memset(r1,0,sizeof(r1));memset(r2,0,sizeof(r2));for(int i=1;i<=n;i++){l1[s1[i]-'A']=min(l1[s1[i]-'A'],i);r1[s1[i]-'A']=i;}for(int i=1;i<=m;i++){l2[s2[i]-'A']=min(l2[s2[i]-'A'],i);r2[s2[i]-'A']=i;}for(int i=0;i<=n;i++){for(int j=0;j<=m;j++){int cnt=0;int res=0x3f3f3f3f;for(int k=0;k<26;k++){if( (l1[k]<=i || l2[k]<=j) && (r1[k]>i || r2[k]>j))cnt++;}if(i) res=min(res,dp[i-1][j]);if(j) res=min(res,dp[i][j-1]);if(res==0x3f3f3f3f)res=0;dp[i][j]=cnt+res;}}printf("%d\n",dp[n][m]);}}