uva11488 Hyper Prefix Sets（Trie树）

H	Hyper Prefix Sets

 

Prefix goodness of a set string is length of longest common prefix*number of strings in the set. For example the prefix goodness of the set {000,001,0011} is 6.You are given a set of binary strings. Find the maximum prefix goodness among all possible subsets of these binary strings.

Input
First line of the input contains T(≤20) the number of test cases. Each of the test cases start with n(≤50000) the number of strings. Each of the next n lines contains a string containing only 0 and 1. Maximum length of each ofthese string is 200.

Output
For each test case output the maximum prefix goodness among all possible subsets of n binary strings.

Sample Input                             Output for Sample Input

4 4 0000 0001 10101 010 2 01010010101010101010 11010010101010101010 3 010101010101000010001010 010101010101000010001000 010101010101000010001010 5 01010101010100001010010010100101 01010101010100001010011010101010 00001010101010110101 0001010101011010101 00010101010101001

6 20 66 44

---

Problem Setter : Abdullah Al Mahmud
Special Thanks : Manzurur Rahman Khan

解题思路：求最长公共前缀*串个数的最大值，把每个串插入trie树，每个经过的节点计数器加1，最后遍历所有节点即可。很水。

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int t,n;
char s[201];
int L,rt,nxt[10000010][2],end[10000010],h[10000010];
int newnode(){
    memset(nxt[L],0,sizeof nxt[L]);
    end[L++]=0;
    return L-1;
}
void init(){
    L=0;
    rt=newnode();
}
void insert(char *s){
    int l=strlen(s),now=rt;
    for(int i=0;i<l;i++){
        end[now]++;
        int z=s[i]-'0';
        if(nxt[now][z]==0) nxt[now][z]=newnode(),h[L-1]=h[now]+1;
        now=nxt[now][z];
    }
    end[now]++;
}
int main(){
    scanf("%d",&t);
    for(int ca=1;ca<=t;ca++){
        scanf("%d",&n);
        init();
        for(int i=0;i<n;i++){
            scanf("%s",s);
            insert(s);
        }
        int ans=0;
        for(int i=0;i<L;i++){
            ans=max(ans,h[i]*end[i]);
        }
        printf("%d\n",ans);
    }
    return 0;
}