hdu 2222

题目来源：http://acm.hdu.edu.cn/showproblem.php?pid=2222

之前写过，现在又追加了一个删除操作，不至于程序运行完，内存仍被占用着！

#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;

const int MAXN = 500010;

struct Trie_Node
{
    int kcount;
    Trie_Node* pNext[26];
    Trie_Node* pFail;
    Trie_Node()
    {
        kcount = 0;
        memset(pNext, NULL, sizeof(pNext));
        pFail = NULL;
    }
};
Trie_Node* pRoot;
Trie_Node* Q[MAXN];

void Build_Trie(char* str)
{
    int i, j;
    Trie_Node* p = pRoot;
    i = 0;
    while(str[i])
    {
        j = str[i++] - 'a';
        if(p->pNext[j] == NULL)
            p->pNext[j] = new Trie_Node;
        p = p->pNext[j];
    }
    p->kcount++;
}

void Build_Fail()
{
    int i, qs, qe;
    qs = qe = 0;
    Q[qe++] = pRoot;
    pRoot->pFail = NULL;
    while(qs < qe)
    {
        Trie_Node* tmp = Q[qs++];
        Trie_Node* p = NULL;
        for(i = 0; i < 26; ++i)
        {
            if(tmp->pNext[i] != NULL)
            {
                if(tmp == pRoot)
                    pRoot->pNext[i]->pFail = pRoot;
                else
                {
                    p = tmp->pFail;
                    while(p != NULL)
                    {
                        if(p->pNext[i] != NULL)
                        {
                            tmp->pNext[i]->pFail = p->pNext[i];
                            break;
                        }
                        p = p->pFail;
                    }
                    if(p == NULL)
                        tmp->pNext[i]->pFail = pRoot;
                }
                Q[qe++] = tmp->pNext[i];
            }
        }
    }
}

void Delete_Trie(Trie_Node* p)
{
    Trie_Node* tmp = p;
    for(int i = 0; i < 26; ++i)
    {
        if(tmp->pNext[i] != NULL)
            Delete_Trie(tmp->pNext[i]);
    }
    delete p;
}

int Query_Trie(char* str)
{
    int i, j, sum;
    Trie_Node* p = pRoot;
    Trie_Node* tmp;
    sum = 0, i = 0;
    while(str[i])
    {
        j = str[i++] - 'a';
        while(p->pNext[j] == NULL && p != pRoot)
            p = p->pFail;
        p = (p->pNext[j] == NULL) ? pRoot : p->pNext[j];
        tmp = p;
        while(tmp != pRoot && tmp->kcount != -1)
        {
            sum += tmp->kcount;
            tmp->kcount = -1;
            tmp = tmp->pFail;
        }
    }
    return sum;
}

int main()
{
    int T, n;
    char str1[1000010], str2[110];
    scanf("%d", &T);
    while(T--)
    {
        pRoot = new Trie_Node;
        scanf("%d", &n);
        while(n--)
        {
            scanf("%s", str2);
            Build_Trie(str2);
        }
        Build_Fail();
        scanf("%s", str1);
        printf("%d\n", Query_Trie(str1));
    }
    Delete_Trie(pRoot);
    return 0;
}