UVA 1401 Remember the Word(字典树)

定义状态d[i]=sum{(d[i]+d[i+len(x)])%MOD},x是从i～L字符串的前缀字符串，那么d[i]的值代表i～L有多少种可能性，一直向前递推，知道i为0。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define ss(x) scanf("%d",&x)
const int maxnode=4000*100+5;
char text[300005],word[100+5];
int len[4000+5];
int d[300005];
struct Trie{
    int ch[maxnode][26];
    int val[maxnode];
    int sz;
    void clear() {sz=1;memset(ch[0],0,sizeof(ch[0]));}
    int idx(char c) {return c-'a';}
    
    void Insert(char *s,int v)
    {
        int u=0;
        for(int i=0;s[i];i++)
        {
            int c=idx(s[i]);
            if(ch[u][c]==0){
                memset(ch[sz],0,sizeof(ch[sz]));
                val[sz]=0;
                ch[u][c]=sz++;
            }
            u=ch[u][c];
        }
        val[u]=v;
    }
    
    void find_prefixs(const char *s,int len,vector<int> &v)
    {
        int u=0;
        rep(i,0,len-1){
            if(s[i]=='\0') break;
            int c=idx(s[i]);
            if(ch[u][c]==0) break;
            u=ch[u][c];
            if(val[u]!=0) v.push_back(val[u]);
        }
    }
};

Trie trie;
int S;
const int MOD=20071027;
int main()
{
    int kase=0;
    while(scanf("%s%d",text,&S)!=EOF)
    {
        trie.clear();
        rep(i,1,S){
            scanf("%s",word);
            len[i]=(int)strlen(word);
            trie.Insert(word,i);
        }
        int L=(int)strlen(text);
        memset(d,0,sizeof(d));
        d[L]=1;
        for(int i=L-1;i>=0;i--)
        {
            vector<int> p;
            trie.find_prefixs(text+i,L-i,p);
            for(int j=0;j<p.size();j++)
            {
                d[i]=(d[i]+d[i+len[p[j]]])%MOD;
            }
        }
        printf("Case %d: %d\n",++kase,d[0]);
    }
    return 0;
}