美脚丝袜一区二区三区在线观看 ,亚洲免费在线看,亚洲国产美女

Pku 3080--Blue Jeans(暴力枚�D + KMP)

Mon, 09 Mar 2009 04:51:00 GMT

摘要: 更好的方法：后缀数组 + 栈扫描我的程序还可以在优化下�Q�记录当前的长度�Q�不��L��索比它小的子�? 1#include 2#include 3 4const int STRNUM = 10&n... 阅读全文

�?/a> 2009-03-09 12:51 发表评论

Pku 3630--Phone List(Trie)

Sun, 09 Nov 2008 15:58:00 GMT

直接套用Trie

#include <stdio.h>
#include <cstring>

const int CAP = 10 ;
const int MAXN = 80001 ;

struct TREENODE
{
    TREENODE *next[CAP] ;
    bool exist ;
    TREENODE() {
        exist = false ;

        for ( int i = 0 ; i < CAP ; ++i )
            next[i] = NULL ;
    }
} ;
TREENODE g_Temp[MAXN] ;

void Del(int pos)
{
    for ( int i = 0 ; i < CAP ; ++i )
        g_Temp[pos].next[i] = NULL ;
    g_Temp[pos].exist = false ;
}

struct TRIE
{
    TREENODE *head ;
    int m_Index ;

    TRIE() {
        m_Index = 1 ;
        head = &g_Temp[0] ;
    }

    bool Insert( char* phNum )
    {
        TREENODE *ptr = head ;
        int len = strlen(phNum) ;

        for ( int i = 0 ; i < len ; ++i )
        {
            if ( ptr->next[phNum[i] - '0'] == NULL )
            {
                Del( m_Index ) ;
                ptr->next[phNum[i] - '0'] = &g_Temp[m_Index++] ;
            }
            else if ( i == len - 1 )
            {
                return true ;
            }
            else if ( ptr->next[phNum[i] - '0']->exist )
            {
                return true ;
            }
            ptr = ptr->next[phNum[i] - '0'] ;
        }

        ptr->exist = true ;

        return false ;
    }

    void Init()
    {
        m_Index = 1 ;
        Del( 0 ) ;
    }

} ;

int main()
{
//    freopen("in.txt", "r", stdin) ;
    int t , n , i ;
    char phoneNum[12] ;
    bool collision ;
    scanf("%d", &t) ;
    TRIE trie ;
    while ( t-- )
    {
        scanf("%d", &n) ;
        collision = false ;
        trie.Init() ;

        for ( i = 0 ; i < n ; ++i )
        {
            scanf("%s", &phoneNum) ;

            if ( !collision )
            {
                collision = trie.Insert( phoneNum ) ;
            }
        }

        if ( !collision ) {
            printf("YES\n") ;
        }
        else {
            printf("NO\n") ;
        }
    }
    return 0 ;
}

�?/a> 2008-11-09 23:58 发表评论

Pku 2503--Babelfish(Trie)

Sun, 09 Nov 2008 14:18:00 GMT

摘要: #include #include #define CAP 26typedef struct NODE{ NODE() {&... 阅读全文

�?/a> 2008-11-09 22:18 发表评论

Pku 1816--Wild Words(Trie + DFS)

Sun, 09 Nov 2008 09:05:00 GMT

摘要: #include #include #include using namespace std ;struct WORD { int ID... 阅读全文

�?/a> 2008-11-09 17:05 发表评论

Sat, 08 Nov 2008 07:50:00 GMT

摘要: Trie + �q�查�?#include #include const int MAXN = 600002 ;int father[MAXN] ;int degree[MAXN] ;int N ;int&nbs... 阅读全文

�?/a> 2008-11-08 15:50 发表评论

Sat, 08 Nov 2008 06:17:00 GMT

摘要: Memory: 4440K Time: 657MS Language: C++ Result: Accepted #include #include... 阅读全文

�?/a> 2008-11-08 14:17 发表评论

Pku 2774--Long Long Message�Q�后�~�树）

Sat, 08 Nov 2008 06:15:00 GMT

摘要: Memory: 74320K Time: 797MS Language: C++ Result: Accepted #include #includ... 阅读全文

�?/a> 2008-11-08 14:15 发表评论