UVA 11488 Hyper Prefix Sets 字典树

#include<bits/stdc++.h>  
using namespace std;
const int MAX = 5e4 + 5;
string s;
int n, t, ans;
struct Trie {
    Trie *next[2];
    int vis;
    Trie()   //这个方法开节点很方便的，码一下
    {
        for (int i = 0; i<2; i++)
            this->next[i] = NULL;
        this->vis = 0;
    }
};
void insertrie(Trie* rt, string s)
{
    int len = s.length();
    Trie *p = rt;
    for (int i = 0; i<len; i++)
    {
        int id = s[i] - ‘0‘;
        if (p->next[id] == NULL)
        {
            p->next[id] = new Trie;
        }
        p = p->next[id];
        p->vis++;
        ans = max(ans, (i+1)*p->vis);
    }
}
int main()
{
    cin >> t;
    while (t--)
    {
        cin >> n;
        ans = 0;
        Trie *rt=new Trie;
        for (int i = 0; i<n; i++)
        {
            cin >> s;
            insertrie(rt, s);
        }
        cout << ans << endl;
    }
    return 0;
}