2014 网选 5007 Post Robot（暴力或者AC_自动机（有点小题大作了））

//暴力，从每一行的开始处开始寻找要查询的字符
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

char str[];

int main(){
    while(gets(str)){
        for(int i=; str[i]; ++i)
            if(str[i]=='A'){
                if(strstr(str+i, "Apple") == str+i)
                    printf("MAI MAI MAI!\n");
            }
            else if(str[i]=='i'){
                if(strstr(str+i, "iPhone") == str+i || strstr(str+i, "iPod") == str+i || strstr(str+i, "iPad") == str+i)
                    printf("MAI MAI MAI!\n");
            }
            else if(str[i]=='S')
                if(strstr(str+i, "Sony") == str+i)
                    printf("SONY DAFA IS GOOD!\n");
    }
    return ;
} 

 //将要匹配的字符串（也就是题目中查询文本中出现的5个单词）建立trie树，然后生成AC_自动机.....
 #include<iostream>
 #include<cstring>
 #include<queue>
 #include<cstdio>
 #include<algorithm>
 using namespace std;

 int trie[][];
 int vis[], fail[];//vis标记的是单词的末尾字符所在的节点
 char str[][] = {"Apple", "iPhone", "iPod", "iPad", "Sony"};
 int cnt;
 void buildT(){
     for(int i=; i<; ++i){
         int u=;
         for(int j=; str[i][j]; ++j){
             if(trie[u][str[i][j]] == )
                 trie[u][str[i][j]] = ++cnt;
             u=trie[u][str[i][j]];
         }
         vis[u]=;
     }
 }

 void getFail(){
     queue<int>q;
     for(int i=; i<; ++i)
         if(trie[][i]) q.push(trie[][i]);
     while(!q.empty()){
         int u = q.front();
         q.pop();
         int v;
         for(int i=; i<; ++i)
             if(v = trie[u][i]){
                 fail[v] = trie[fail[u]][i];
                 q.push(v);
             }
             else
                 trie[u][i] = trie[fail[u]][i];
     }
 }

 void getText(char *ch){
     int u=;
     for(int i=; ch[i]; ++i){
         int v = trie[u][ch[i]];
         u=v;
         while(v){
             if(vis[v] && (ch[i]=='d' || ch[i]=='e'))
                 printf("MAI MAI MAI!\n");
             else if(vis[v] && ch[i]=='y')
                 printf("SONY DAFA IS GOOD!\n");
             v = fail[v];
         }
     }
 }

 char text[];

 int main(){
     buildT();
     getFail();
     while(gets(text)){
         getText(text);
     }
     return ;
 }