HDU 4416 Good Article Good sentence

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 typedef long long LL;
 4 const int maxn = 100010;
 5 int sa[maxn<<1],c[maxn];
 6 struct node{
 7     int son[26],f,len,deep;
 8     void init(){
 9         memset(son,-1,sizeof son);
10         deep = len = 0;
11         f = -1;
12     }
13 };
14 struct SAM{
15     node e[maxn<<1];
16     int tot,last;
17     int newnode(int len = 0){
18         e[tot].init();
19         e[tot].len = len;
20         return tot++;
21     }
22     void init(){
23         tot = last = 0;
24         newnode();
25     }
26     void add(int c){
27         int p = last,np = newnode(e[p].len + 1);
28         while(p != -1 && e[p].son[c] == -1){
29             e[p].son[c] = np;
30             p = e[p].f;
31         }
32         if(p == -1) e[np].f = 0;
33         else{
34             int q = e[p].son[c];
35             if(e[p].len + 1 == e[q].len) e[np].f = q;
36             else{
37                 int nq = newnode();
38                 e[nq] = e[q];
39                 e[nq].len = e[p].len + 1;
40                 e[q].f = e[np].f = nq;
41                 while(p != -1 && e[p].son[c] == q){
42                     e[p].son[c] = nq;
43                     p = e[p].f;
44                 }
45             }
46         }
47         last = np;
48     }
49     void update(char *str){
50         int ln = 0,p = 0;
51         for(int i = 0; str[i]; ++i){
52             int c = str[i] - ‘a‘;
53             if(e[p].son[c] != -1){
54                 p = e[p].son[c];
55                 e[p].deep = max(e[p].deep,++ln);
56             }else{
57                 while(p != -1 && e[p].son[c] == -1) p = e[p].f;
58                 if(p == -1) p = ln = 0;
59                 else{
60                     ln = e[p].len + 1;
61                     p = e[p].son[c];
62                     e[p].deep = max(e[p].deep,ln);
63                 }
64             }
65         }
66     }
67     LL count(){
68         LL ret = 0;
69         for(int i = tot-1; i > 0; --i){
70             int v = sa[i];
71             if(e[v].deep > 0){
72                 e[e[v].f].deep = max(e[e[v].f].deep,e[v].deep);
73                 if(e[v].deep < e[v].len) ret += e[v].len - e[v].deep;
74             }else ret += e[v].len - e[e[v].f].len;
75         }
76         return ret;
77     }
78 }sam;
79 char str[maxn];
80 int main(){
81     int kase,m,cs = 1;
82     scanf("%d",&kase);
83     while(kase--){
84         scanf("%d%s",&m,str);
85         sam.init();
86         for(int i = 0; str[i]; ++i) sam.add(str[i] - ‘a‘);
87         memset(c,0,sizeof c);
88         for(int i = 0; i < sam.tot; ++i) c[sam.e[i].len]++;
89         for(int i = 1,len = strlen(str); i <= len; ++i) c[i] += c[i-1];
90         for(int i = sam.tot-1; i >= 0; --i) sa[--c[sam.e[i].len]] = i;
91         while(m--){
92             scanf("%s",str);
93             sam.update(str);
94         }
95         printf("Case %d: %I64d\n",cs++,sam.count());
96     }
97     return 0;
98 }