POJ 1625 Censored!(大数+DP)

题目链接

这题，真心木啥意思，就是数据里貌似字符有负数，注意gets读入。。

 #include <iostream>
 #include <cstring>
 #include <cstdio>
 #include <queue>
 #include <algorithm>
 #include <cstdlib>
 using namespace std;
 int trie[][];
 int dp[][][];
 int o[];
 int que[];
 int fail[];
 int id[];
 int t,N;
 void CL()
 {
     t = ;
     memset(trie,-,sizeof(trie));
     memset(dp,,sizeof(dp));
     memset(o,,sizeof(o));
     memset(id,,sizeof(id));
 }
 void insert(char *str)
 {
     int len,i,root;
     len = strlen(str);
     root = ;
     for(i = ;i < len;i ++)
     {
         if(trie[root][id[str[i]+]] == -)
         trie[root][id[str[i]+]] = t ++;
         root = trie[root][id[str[i]+]];
     }
     o[root] = ;
 }
 void build_ac()
 {
     int front,tail,head,i;
     head = tail = ;
     for(i = ;i < N;i ++)
     {
         if(trie[][i] != -)
         {
             fail[trie[][i]] = ;
             que[tail++] = trie[][i];
         }
         else
         {
             trie[][i] = ;
         }
     }
     while(head != tail)
     {
         front = que[head++];
         if(o[fail[front]])
         o[front] = ;
         for(i = ;i < N;i ++)
         {
             if(trie[front][i] != -)
             {
                 que[tail++] = trie[front][i];
                 fail[trie[front][i]] = trie[fail[front]][i];
             }
             else
             {
                 trie[front][i] = trie[fail[front]][i];
             }
         }
     }
 }
 int main()
 {
     int M,P,i,j,k,u;
     int ans[];
     char ch[];
     while(scanf("%d%d%d%*c",&N,&M,&P)!=EOF)
     {
         CL();
         gets(ch);
         for(i = ;i < N;i ++)
         {
             id[ch[i]+] = i;
         }
         for(i = ;i < P;i ++)
         {
             gets(ch);
             insert(ch);
         }
         build_ac();
         dp[][][] = ;
         for(i = ;i < M;i ++)
         {
             for(j = ;j < t;j ++)
             {
                 if(o[j]) continue;
                 for(k = ;k < N;k ++)
                 {
                     if(o[trie[j][k]]) continue;
                     for(u = ;u < ;u ++)
                     {
                         dp[i+][trie[j][k]][u] += dp[i][j][u];
                     }
                     for(u = ;u < ;u ++)
                     {
                         if(dp[i+][trie[j][k]][u] > )
                         {
                             dp[i+][trie[j][k]][u+] += dp[i+][trie[j][k]][u]/;
                             dp[i+][trie[j][k]][u] = dp[i+][trie[j][k]][u]%;
                         }
                     }
                 }
             }
         }
         memset(ans,,sizeof(ans));
         for(i = ;i < t;i ++)
         {
             for(u = ;u < ;u ++)
             {
                 ans[u] += dp[M][i][u];
             }
             for(u = ;u < ;u ++)
             {
                 if(ans[u] > )
                 {
                     ans[u+] += ans[u]/;
                     ans[u] = ans[u]%;
                 }
             }
         }
         int flag = ;
         for(i = ;i >= ;i --)
         {
             if(ans[i] > )
             flag = ;
             if(flag)
             printf("%d",ans[i]);
         }
         if(flag == )
         printf("0\n");
         else
         printf("\n");
     }
     return ;
 }