hdu3065 病毒侵袭持续中

病毒侵袭持续中

题目背景：

HDU - 3065

分析：AC自动机，直接建好跑就OK只是需要在去重的时候小心，它是问出现了几次，盲目去重就会错的很惨。

Source：

#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
        
        
#include 
        
        
         
         
#include 
         
         
           #include 
          
            #include 
           
             using namespace std; const int MAXN = 50000 + 30; string s; string s1[1010]; int n, tot, cas, head, tail; int f[MAXN][27], fail[MAXN], first[MAXN], queue[MAXN]; int ans[MAXN]; void build_trie(string &s) { int len = s.size(), position = 0; for(int i = 0; i < len; ++i) { if(!f[position][s[i] - 'A']) f[position][s[i] - 'A'] = ++tot; position = f[position][s[i] - 'A']; } first[position] = ++cas; } void build_AC() { head = 0, tail = 1, queue[tail] = 0; while(head < tail) { head++; for(int i = 0; i < 26; ++i) { if(f[queue[head]][i]) { if(queue[head]) fail[f[queue[head]][i]] = f[fail[queue[head]]][i]; tail++, queue[tail] = f[queue[head]][i]; } else f[queue[head]][i] = f[fail[queue[head]]][i]; } } } void read() { for(int i = 1; i <= n; ++i) cin >> s1[i], build_trie(s1[i]); char c = getchar(); while(c != '\n') c = getchar(); } void get() { getline(cin, s); int position = 0, len = s.size(); for(int i = 0; i < len; ++i) { if(s[i] < 'A' || s[i] > 'Z') { position = 0; continue; } position = f[position][s[i] - 'A']; int temp = position; while(temp) ans[first[temp]]++, temp = fail[temp]; } for(int i = 1; i <= n; ++i) if(ans[i]) cout << s1[i] << ": " << ans[i] << '\n'; } void clear() { memset(queue, 0, sizeof(queue)); memset(f, 0, sizeof(f)); memset(fail, 0, sizeof(fail)); memset(first, 0, sizeof(first)); memset(ans, 0 ,sizeof(ans)); tot = cas = 0; } int main() { while(cin >> n) { read(); build_AC(); get(); clear(); } return 0; }