UVa 11488 Hyper Prefix Sets Trie树计算最大公共前缀长度*个数

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 of these 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

 

 

题意：可以得到的权值为某个前缀的长度*这个前缀的字符串的个数。

Trie树模版题

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int ans;char str[205];struct Trie{    int index;    Trie *next[10];    Trie()    {        index=0;        memset(next,0,sizeof(next));    }};void Insert(Trie *tr,char *s,int len){    tr->index++;    ans=max(ans,tr->index*len);    if(*s!='\0')    {        if(tr->next[*s-'0']==0)            tr->next[*s-'0']=new Trie;        Insert(tr->next[*s-'0'],s+1,len+1);    }}int main(){    int T,n,i,j,k;    scanf("%d",&T);    while(T--)    {        scanf("%d",&n);        Trie *root=new Trie;        ans=0;        while(n--)        {            scanf("%s",str);            Insert(root,str,0);        }        printf("%d\n",ans);    }    return 0;}