USACO 2.3.1 Longest Prefix --- Trie

 /*
 PROG:   prefix
 ID  :   
 LANG:   C++
 */
 #include <string.h>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <iostream>
 #include <memory.h>
 #include <algorithm>
 using namespace std;
 
 struct Trie_Node
 {
     bool IsEnd;
     Trie_Node *branch[26];
     Trie_Node(): IsEnd( false )
     {
         memset( branch, 0, sizeof(branch) );
     }// Init
 };
 
 class Trie
 {    
     public:
         Trie();
         void Trie_Insert( char tt[] );
         void Trie_Find( long j );
     
     private:
         Trie_Node *root;
 }t; // type class "Trie" object t
 
 long slen;
 bool prefix[200400];
 char line[204], ss[200400];
 
 Trie::Trie()
 {
     root = new Trie_Node();
 }// Trie
 
 void Trie::Trie_Insert( char tt[] )
 {
     Trie_Node *ptr = root;
     int tlen = strlen( tt );
     for ( int i=0; i<tlen; ++i )
     {
         if ( ptr->branc