C++博客-gzwzm06-文章分类-字符串处理

POJ 2408--Anagram Groups

Sun, 29 Mar 2009 12:55:00 GMT

1#include <cstdio>
2#include <cstring>
3#include <algorithm>
4using namespace std;
5
6const int SIZE = 30001;
7const int LEN = 30;
8
9//用来找出哪些同类
10struct WORD
11{
12    char src[LEN];
13    char after[LEN];
14}word[SIZE];
15
16//用来找出数目最大的五个
17struct GROUP
18{
19    char fst[LEN];
20    int size;
21    int start;
22}group[SIZE];
23
24bool cmp(const WORD& a, const WORD& b )
25{
26    if ( strcmp(a.after, b.after) != 0 )
27        return ( strcmp(a.after, b.after) < 0 );
28    return (strcmp(a.src, b.src) <= 0 );
29}
30
31bool cmpGP(const GROUP& a, const GROUP& b)
32{
33    if ( a.size != b.size )
34        return (a.size > b.size);
35    else
36        return (strcmp(a.fst, b.fst) <= 0);
37}
38
39int main()
40{
41//    freopen("1.txt", "r", stdin);
42    int n, gp, len, i, j, k, p;
43
44    n = 0;
45
46    while ( scanf("%s", word[n].src) != EOF )
47    {
48        strcpy(word[n].after, word[n].src);
49        len = strlen(word[n].after);
50        sort(word[n].after, word[n].after + len);
51        n++;
52    }
53
54    sort(word, word + n, cmp);
55
56    gp = 1;
57    group[0].size = 1;
58    group[0].start = 0;
59    strcpy(group[0].fst, word[0].src);
60    for ( i = 1; i < n; ++i )
61    {
62        if ( strcmp(word[i].after, word[i - 1].after) == 0 )
63        {
64            group[gp - 1].size++;
65        }
66        else {
67            group[gp].size = 1;
68            group[gp].start = i;
69            strcpy(group[gp].fst, word[i].src);
70            gp++;
71        }
72    }
73
74    sort(group, group + gp, cmpGP);
75
76    for ( i = 0; i < 5; ++i )
77    {
78        printf("Group of size %d:", group[i].size);
79
80        p = group[i].start;
81        for ( j = 0; j < group[i].size; ++j )
82        {
83            for ( k = j - 1; k >= 0; --k )
84            {
85                //相同的单词只需打印一次
86                if ( strcmp(word[k].src, word[j].src) == 0 )
87                    break;
88            }
89            if ( k < 0 || j == 0 )
90                printf(" %s", word[p + j].src);
91        }
92        printf(" .\n");
93    }
94
95    return 0;
96}

巫 2009-03-29 20:55 发表评论

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

Mon, 09 Mar 2009 04:51:00 GMT

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

巫 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 ;
}

巫 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() {&... 阅读全文

巫 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... 阅读全文

巫 2008-11-09 17:05 发表评论

Pku 2513--Colored Sticks（Trie）

Sat, 08 Nov 2008 07:50:00 GMT

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

巫 2008-11-08 15:50 发表评论

Pku 2774--Long Long Message（后缀数组）

Sat, 08 Nov 2008 06:17:00 GMT

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

巫 2008-11-08 14:17 发表评论

Pku 2774--Long Long Message（后缀树）

Sat, 08 Nov 2008 06:15:00 GMT

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

巫 2008-11-08 14:15 发表评论