uva11732 字典树

来源：互联网发布：java boolean几个字节编辑：程序博客网时间：2024/05/21 12:48

#include <cstdio>#include <iostream>#include <cstring>using namespace std;#define LL long long  const int maxnode = 4000*1000+10;int head[maxnode];int next[maxnode];int tot[maxnode];int va[maxnode];LL ans  = 0; int sz = 0;int insert(char *s){    int n = strlen(s);    int u = 0;    for(int i = 0;i <= n;i++){        int flag = -1;        for(int t = head[u];t;t =next[t]){            if(va[t] == s[i]){                ans += tot[t];                flag = t;            }            ans+=tot[t];         }        if(flag == -1){            next[sz] = head[u];            flag = sz;            va[flag] = s[i];            tot[sz] = 0;            head[sz] = 0;            head[u] = sz++;        }        u = flag;        tot[flag]++;       }} char s[1005];int main(){    int n;    int t = 1;//  freopen("1.txt","r",stdin);//  freopen("2.txt","w",stdout);     while(scanf("%d",&n)!=EOF){        if(n == 0) break;        ans = 0;        sz = 1;        head[0] = 0;        next[0] = 0;        tot[0] = 0;        for(int i = 0;i < n;i++){            scanf("%s",s);            insert(s);        }        printf("Case %d: %lld\n",t++,ans);    }   }

很简单的字典树，做了一天了，跟人对拍了块2000组，最后竟然是lld和I64d的问题，不说了，吐口血去！不过也有好处，不过也有好处，学到了一种新的写法！还可以！

0 0