hdu 1075 What Are You Talking About

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

const int MAXN = 30010;
const int N = 26;

struct Node{
int index;
Node* child
;
};
char word[MAXN][10];
Node node[MAXN];
Node* root;
int pos;

Node* newNode(){
node[pos].index = -1;
for(int i = 0 ; i < N ; i++)
node[pos].child[i] = NULL;
return &node[pos++];
}

void insert(int index , char *str){
Node* s = root;
int len = strlen(str);
for(int i = 0 ; i < len ; i++){
int num = str[i]-'a';
if(s->child[num] == NULL)
s->child[num] = newNode();
s = s->child[num];
}
s->index = index;
}

int search(char *str){
Node* s = root;
int len = strlen(str);
for(int i = 0 ; i < len ; i++){
int num = str[i]-'a';
if(s->child[num] == NULL)
return -1;
s = s->child[num];
}
return s->index;
}

void solve(char *str){
int len = strlen(str);
char tmp[MAXN];
int i = 0;
while(i < len){
if(!islower(str[i])){
printf("%c" , str[i]);
i++;
continue;
}
memset(tmp , '\0' , sizeof(tmp));
int j = i;
int index = 0;
while(j < len && islower(str[j]))
tmp[index++] = str[j++];
int cnt = search(tmp);
if(cnt == -1)
printf("%s" , tmp);
else
printf("%s" , word[cnt]);
printf("%c" , str[j]);
i = j+1;
}
puts("");
}

int main(){
pos = 0;
root = newNode();
char str[MAXN];
int index = 0;

scanf("%s" , str);
while(scanf("%s" , word[index])){
if(strcmp(word[index] , "END") == 0)
break;
scanf("%s" , str);
insert(index++ , str);
}
scanf("%s%*c" , str);
while(gets(str)){
if(strcmp(str , "END") == 0)
break;
solve(str);
}
return 0;
}