poj3267The Cow Lexicon（dp）

http://poj.org/problem?id=3267

对dp没研究 看了看解题报告 还是比较好推的 dp[i] = min{dp[i]-1,dp[j]+i-j-length[k]} 若从J到i包含字典中的单词

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char word[650][30];
int main()
{
    int i,j,k,n,m,dp[310],kk[610];
    char str[310];
    while(cin>>n>>m)
    {
        cin>>str;
        memset(dp,0,sizeof(dp));
        for(i = 1; i <= n; i++)
        {
            cin>>word[i];
            kk[i] = strlen(word[i]);
        }
        for(i = 0 ; i < m ; i++)
        {
            int mi = 1000;
            if(i>0)
            dp[i] = dp[i-1]+1;
            else
            dp[i] = 1;
            for(j = 1 ; j <= n ; j++)
            {
                int g = kk[j]-1,tk = i;
                while(tk>=0&&g>=0&&(i-tk+1-kk[j])<dp[i])
                {
                    if(str[tk]==word[j][g])
                    g--;
                    tk--;
                }
                if(tk<0)
                tk = 0;
                if(g<0)
                {
                    mi = min(mi,i-tk-kk[j]+dp[tk]);
                }
                else
                mi = min(mi,i-tk+dp[tk]);
            }
            if(mi!=1000)
            dp[i] = min(dp[i],mi);
        }
        cout<<dp[m-1]<<endl;
    }
    return 0;
}