poj 2011 Shortest Prefixes 简单字典树

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<iomanip>
#include<climits>
#define INF 1e11
#define MAXN 10010 
using namespace std;


//适用于正负整数
template <class T>
inline bool scan_d(T &ret) {
    char c; int sgn;
    if (c = getchar(), c == EOF) return 0; //EOF
    while (c != '-' && (c<'0' || c>'9')) c = getchar();
    sgn = (c == '-') ? -1 : 1;
    ret = (c == '-') ? 0 : (c - '0');
    while (c = getchar(), c >= '0'&&c <= '9') ret = ret * 10 + (c - '0');
    ret *= sgn;
    return 1;
}

struct node{
    int next[26];
    int cnt;
    void init()
    {
        cnt = 0;
        memset(next,-1,sizeof(next));
    }
}T[MAXN];

int le;

void Insert(string s)
{
    int i = 0, p = 0;
    while (s[i]) {
        int x = s[i] - 'a';
        if (T[p].next[x] == -1) {
            T[le].init();
            T[p].next[x] = le++;
        }
        p = T[p].next[x];
        T[p].cnt++;
        i++;
    }
}

void query(string s)
{
    int i = 0, p = 0;
    while (s[i])
    {
        int x = s[i] - 'a';
        if (T[p].cnt == 1) break;
            cout << s[i];
        p = T[p].next[x];
        i++;
    }
    //printf("%d
", T[p].cnt);
}

string s[MAXN];

int main()
{
    le = 1;
    T[0].init();
    int n = 0;
    while (cin >> s[n])
    {
        Insert(s[n++]);
    }
    //T[0].cnt = n;
    for (int j = 0; j < n; ++j) {
        cout << s[j] << " ";
        query(s[j]);
        cout << endl;
    }
    //system("pause");
    return 0;
}