Uva1401 Remember the Word

用trie树匹配字串，树上套个dp即可

/*By SilverN*/
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define LL long long
using namespace std;
const int mxn=400010;
const int mod=20071027;
struct trie{
    int a[mxn][26];
    int end[mxn];
    int cnt;
    void insert(char s[]){
        int len=strlen(s);
        int now=1;
        for(int i=0;i<len;++i){
            if(!a[now][s[i]-'a'])a[now][s[i]-'a']=++cnt;
            now=a[now][s[i]-'a'];
        }
        end[now]++;
    }
};
trie t;
char s[mxn];
char c[mxn];
int n;
int f[mxn];
void dp(int cas){
    memset(f,0,sizeof f);
    int len=strlen(s+1);
    int i,j;
    f[len+1]=1;
    for(i=len;i;--i){
        int now=1;
        for(j=i;j<=len;++j){
            now=t.a[now][s[j]-'a'];
            if(!now)break;
            if(t.end[now])
                f[i]=(f[i]+f[j+1])%mod;
        }
//        printf("f[%d]==%d
",i,f[i]);
    }
    printf("Case %d: %d
",cas,f[1]);
    return;
}
int main(){
    int cas=0;
    while(scanf("%s",s+1)!=EOF){
        memset(t.a,0,sizeof t.a);
        memset(t.end,0,sizeof t.end);
        t.cnt=1;
        int i,j;
        scanf("%d",&n);
        for(i=1;i<=n;++i){
            scanf("%s",c);
            t.insert(c);
        }
        dp(++cas);
    }
    return 0;
}