大二专题第一周 E - Hyper Prefix Sets

应该是uva的题目比较水数组大小开错re一次

规定最大串长为 最长前缀*有此前缀的个数

ACcode：

#pragma warning(disable:4786)//使命名长度不受限制
#pragma comment(linker, "/STACK:102400000,102400000")//手工开栈
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#define rd(x) scanf("%d",&x)
#define rd2(x,y) scanf("%d%d",&x,&y)
#define rds(x) scanf("%s",x)
#define rdc(x) scanf("%c",&x)
#define ll long long int
#define maxn 100005
#define mod 1000000007
#define INF 0x3f3f3f3f //int 最大值
#define FOR(i,f_start,f_end) for(int i=f_start;i<=f_end;++i)
#define MT(x,i) memset(x,i,sizeof(x))
#define PI  acos(-1.0)
#define E  exp(1)
#define MAX 2
using namespace std;
struct Trie{
    int v;
    int id;
    int cnt;
    Trie *next[MAX];
};
Trie *root;
int ans,n,loop,len[maxn];
void creat(char *str,int loop,int len){
    Trie *p=root,*q;
    FOR(i,0,len-1){
        int id=str[i]-'0';
        if(p->next[id]==NULL){
            q=(Trie *)malloc(sizeof(Trie));
            q->v=1;
            q->cnt=i+1;
            q->id=loop;
            FOR(i,0,MAX-1)q->next[i]=NULL;
            p->next[id]=q;
            p=p->next[id];
        }else{
            p=p->next[id];
            p->cnt=i+1;
            if(p->id!=loop)
                p->v++;
        }
       // cout<<p->id<<"  "<<p->cnt<<" "<<p->v<<'\12';
    }
}
void  qurey(char *str,int len){
    Trie *p=root;
    FOR(i,0,len-1){
        int id=str[i]-'0';
        p=p->next[id];
        if(p==NULL)return;
        ans=max(ans,p->v*p->cnt);
    }
}
char str[50055][222];
int main(){
    rd(loop);
    while(loop--){
        rd(n);ans=-INF;
        root=(Trie *)malloc(sizeof(Trie));
        FOR(i,0,MAX-1)root->next[i]=NULL;
        FOR(i,1,n){
            rds(str[i]);
            len[i]=strlen(str[i]);
            ans=max(ans,len[i]);
            creat(str[i],i,len[i]);
        }
        FOR(i,1,n)qurey(str[i],len[i]);
        printf("%d\n",ans);
    }
    return 0;
}
/*
4
4
0000
0001
10101
010
2
01010010101010101010
11010010101010101010
3
010101010101000010001010
010101010101000010001000
010101010101000010001010
5
01010101010100001010010010100101
01010101010100001010011010101010
00001010101010110101
0001010101011010101
00010101010101001
*/