What Are You Talking About HDU - 1075

http://acm.hdu.edu.cn/showproblem.php?pid=1075

用map也可以做的SB题 数据读入真的有毒 还不给数据范围

将地球文先存到二维字符数组 用火星文建树 将火星文对应的地球文的指针赋给树上对应的节点

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

struct node
{
    node *next[26];
    char *ch;
};

node *root;
char pre[1000010][20];

void getnode(node *&ptr)
{
    int i;
    ptr=new node;
    for(i=0;i<26;i++) ptr->next[i]=NULL;
    ptr->ch=NULL;
}

void destruct(node *ptr)
{
    int i;
    for(i=0;i<26;i++)
    {
        if(ptr->next[i]!=NULL) destruct(ptr->next[i]);
    }
    delete ptr;
}

void update(node *ptr,char *tmp,char *ch,int cur,int len)
{
    if(ptr->next[ch[cur]-'a']==NULL) getnode(ptr->next[ch[cur]-'a']);
    if(cur==len-1)
    {
        ptr->next[ch[cur]-'a']->ch=tmp;
        return;
    }
    update(ptr->next[ch[cur]-'a'],tmp,ch,cur+1,len);
}

char *query(node *ptr,char *ch,int cur,int len)
{
    if(ptr->next[ch[cur]-'a']==NULL) return NULL;
    if(cur==len-1) return ptr->next[ch[cur]-'a']->ch;
    return query(ptr->next[ch[cur]-'a'],ch,cur+1,len);
}

int main()
{
    int n,i,j;
    char *res;
    char ch[3010],tmp[20];
    n=0;
    scanf("%s",ch);
    while(scanf("%s",pre[n])!=EOF)
    {
        if(pre[n][0]=='E') break;
        n++;
    }
    getnode(root);
    for(i=0;i<n;i+=2)
    {
        update(root,pre[i],pre[i+1],0,strlen(pre[i+1]));
    }
    scanf("%s",ch);
    getchar();
    //while(strcmp(gets(ch),"")!=0)
    while(gets(ch))
    {
        if(ch[0]=='E') break;
        for(i=0,j=0;i<strlen(ch);i++)
        {
            if('a'<=ch[i]&&ch[i]<='z')
            {
                tmp[j++]=ch[i];
            }
            else
            {
                if(j!=0)
                {
                    tmp[j]='\0';
                    res=query(root,tmp,0,j);
                    if(res==NULL) printf("%s",tmp);
                    else printf("%s",res);
                    j=0;
                }
                printf("%c",ch[i]);
            }
        }
        if(j!=0)
        {
            tmp[j]='\0';
            res=query(root,tmp,0,j);
            if(res==NULL) printf("%s",tmp);
            else printf("%s",res);
        }
        printf("\n");
    }
    destruct(root);
    return 0;
}