p1364单词查找树

int end=27;
int i,f,ans=0,boyt,now;
string s;
struct lianbiao
{
    char n;
    int boy[27];
}trie[60000];
int main()
{
//freopen("123.in","r",stdin);
    while(cin>>s)
    {
        now=int(s[0]-64);
        trie[now].n=s[0];
        for(f=1;f<s.size();f++)
        {
            boyt=int(s[f])-64;
            if(trie[trie[now].boy[boyt]].n==s[f])//已经有了
            {
                now=trie[now].boy[boyt];
            }
            else
            {
                trie[end].n=s[f];
                trie[now].boy[boyt]=end;
                now=end;
                end++;
            }
        }
    }
    for(i=1;i<=60000;i++)
        if(trie[i].n!=0)
            ans++;
    cout<<ans+1;
    return 0;
}