[kuangbin带你飞]专题十七 AC自动机 C - 病毒侵袭持续中

要输出每个字符串出现的次数，可以使用一个数组记录下。

#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
char str[1010][100];
struct Trie
{
    int node[1010*50][128],fail[1010*50],num[1010*50];
    int root,L;
    int newnode()
    {
        for(int i = 0;i < 128;i++)
            node[L][i] = -1;
        num[L] = -1;
        return L++;
    }
    void init()
    {
        L = 0;
        root = newnode();
    }
    void insert(char s[],int id)
    {
        int len = strlen(s);
        int now = root;
        for(int i = 0;i < len;i++)
        {
            if(node[now][s[i]] == -1)
                node[now][s[i]] = newnode();
            now = node[now][s[i]];
        }
        num[now] = id;
    }
    void build()
    {
        queue<int>Q;
        fail[root] = root;
        for(int i = 0;i < 128;i++)
            if(node[root][i] == -1)
                node[root][i] = root;
            else
            {
                fail[node[root][i]] = root;
                Q.push(node[root][i]);
            }
        while(!Q.empty())
        {
            int now = Q.front();
            Q.pop();
            for(int i = 0;i < 128;i++)
                if(node[now][i] == -1)
                    node[now][i]=node[fail[now]][i];
                else
                {
                    fail[node[now][i]]=node[fail[now]][i];
                    Q.push(node[now][i]);
                }
        }
    }
    int used[1010];
    void query(char buf[],int n)
    {
        for(int i = 0;i < n;i++)
            used[i] = 0;
        int len=strlen(buf);
        int now=root;
        for(int i=0;i<len;i++)
        {
            now=node[now][buf[i]];
            int temp = now;
            while( temp != root )
            {
                if(num[temp] != -1)
                    used[num[temp]]++;
                temp = fail[temp];
            }
        }
        for(int i = 0;i < n;i++)
            if(used[i] > 0)
                printf("%s: %d\n",str[i],used[i]);
    }

};
Trie ac;
char buf[2000010];
int main()
{
    int n;
    while(scanf("%d",&n) == 1)
    {
        ac.init();
        for(int i = 0;i < n;i++)
        {
            scanf("%s",str[i]);
            ac.insert(str[i],i);
        }
        ac.build();
        scanf("%s",buf);
        ac.query(buf,n);
    }
    return 0;
}
/*
3
AA
BB
CC
ooxxCC%dAAAoen....num
*/