USACO section2.3 Longest Prefix题解&代码

恩…简洁明了的搜索就可以了…
对于每一种可能的情况都递归求其最长前缀…
然后就没了233
代码并不是本人所写…由风格显而易见…

/*
ID:rainbow16
LANG:C++
TASK:prefix
*/
#include<cstdio>
#include<algorithm>
#include<cstring>
const int MAXN=200000+20;
char dict[210][15];
int dp[MAXN];
int len[210];
char s[MAXN];
char t[100];
int sum;
int src(char* ss)
{
    if(dp[ss-s]>0) return dp[ss-s];
    int &ans=dp[ss-s];
    for(int i=0;i<sum;++i)
        if(strncmp(dict[i],ss,len[i])==0)
            ans=std::max(ans,src(ss+len[i])+len[i]);
    return ans;
}
int main()
{
    freopen("prefix.in","r",stdin);
    freopen("prefix.out","w",stdout);
    while(scanf("%s",dict[sum])==1)
    {
        if(dict[sum][0]=='.') break;
        len[sum]=strlen(dict[sum++]);
    }
    while(scanf("%s",t)==1)
    {
        strcat(s,t);
    }
    printf("%d\n",src(s));
    return 0;
}