HDU 3518

http://acm.hdu.edu.cn/showproblem.php?pid=3518

trie

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAX=1001;
char s[MAX];
int sz,len;
int trie[MAX*MAX][26];
int minp[MAX*MAX],maxp[MAX*MAX],dep[MAX*MAX];
void insert_trie(char *str,int d)
{
 int rt=0;
 for (int i=0;str[i];i++)
 {
  int t=str[i]-'a';
  if (!trie[rt][t]){
   trie[rt][t]=++sz;
   memset(trie[sz],0,sizeof(trie[sz]));
   minp[sz]=MAX;maxp[sz]=0;
   dep[sz]=i+1;
  }
  rt=trie[rt][t];
  if (i+d>maxp[rt]) maxp[rt]=i+d;
  if (i+d<minp[rt]) minp[rt]=i+d;
  if (minp[rt]+dep[rt]>len) return;
  
 }
}
int cnt;
void find_trie(int rt)
{

 for (int i=0;i<26;i++){
  if (trie[rt][i]){
      int t=trie[rt][i];
   if (minp[t]+dep[t]<=maxp[t]) {
       cnt++;
       find_trie(t);
   }
   
 
  }
 }
}
int main()
{
 freopen("C:\in.txt","r",stdin);
    while (gets(s))
 {
  if (s[0]=='#') break;
  char *str=s;
  len=strlen(s);
  memset(trie[0],0,sizeof(trie[0]));
  sz=0;
  for (int i=0;s[i];i++)
  {
   insert_trie(str,i);
   str++;
  }
  cnt=0;
  find_trie(0);
  printf("%d\n",cnt);
 } 
 
 return 0;
}