题意:根据字典,将所给字符串翻译成话,删掉无用字符m个,求最小m
/*对第i个字母,有两种情况,选或不选,由此得出dp方程(联想到背包问题)
dp[i] = MIN(dp[i+1]+1,d + dp[k])
附代码:
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define SIZEM 310
#define SIZEW 610
#define MIN(a,b) ((a) < (b) ? (a) : (b));
struct WORD{
char s[30];
int l;
}word[SIZEW];
char msg[SIZEM];
int dp[SIZEM];
int df(int n,int len);
int match(char *,char *);
int cmp(const void *a,const void *b)
{
return ((struct WORD*)a)->l - ((struct WORD*)b)->l;
}
int main()
{
int dp[SIZEM];
int w,l;
int i;
// freopen("in.txt","r",stdin);
scanf("%d%d",&w,&l);
scanf("%s",msg);
for(i = 0; i < w; i++){
scanf("%s",word[i].s);
word[i].l = strlen(word[i].s);
}
qsort(word,w,sizeof(word[0]),cmp);
printf("%d\n",df(w,l));
return 0;
}
/*对第i个字母,有两种情况,选或不选,由此得出dp方程(联想到背包问题)
dp[i] = MIN(dp[i+1]+1,d + dp[k])
*/
int df(int n,int len)
{
int i,j;
int pw,pm;
int d;
int min;
for(i = len,j= 0; i + word[0].l > len; i--){
dp[i] = j++;;
}
for( ; i >= 0; i--){
for(min = 601,j = 0; j < n; j++){
if(word[j].l > len - i)
break;
if(word[j].l == len - i){
if(strcmp(word[j].s,&msg[i]) == 0){
min = 0;
break;
}
else{
min = MIN(len-i,min);
continue;
}
}
d = 0;
for(pw = 0,pm = i; pw < word[j].l && pm < len;pm++){
if(word[j].s[pw] == msg[pm])
pw++;
else
d++;
}
if(pw >= word[j].l && min > d+dp[pm])
min = d+dp[pm];
}
dp[i] = MIN(min,dp[i+1]+1);
}
return dp[0];
}