欧美日韩三级电影在线,国产一区二区精品久久99,久久夜色精品亚洲噜噜国产mv

hdu 1075 What Are You Talking About

DreamSky — Thu, 09 Apr 2009 09:43:00 GMT

摘要: http://acm.hdu.edu.cn/showproblem.php?pid=1075 /**//*STARThh1 aaENDSTARTa aaEND*/#include#includeusing namespace std;int i;struct dictree{&... 阅读全文

DreamSky 2009-04-09 17:43 发表评论

hdu 1251 �l�计��N��

DreamSky — Thu, 09 Apr 2009 06:17:00 GMT

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

#include<iostream>
using namespace std;
struct dictree
{
    struct dictree *child[26];
    int num;
};
int main()
{
    int i;
    char word[11];
    struct dictree root;// = new dictree;
    for(i=0;i<26;i++)
        root.child[i] = NULL;
    root.num = 0;
    while(cin.getline(word,11),word[0])//输入�Ҏ��很niu
    {
        struct dictree *now = &root;
        char *tmp = word;
        while(*tmp)
        {
            if(now->child[*tmp-'a']==NULL)
            {
                now->child[*tmp-'a']=new dictree;
                now=now->child[*tmp-'a'];
                for(i=0;i<26;i++)
                    now->child[i] = NULL;
                now->num = 1;
            }
            else
            {
                now=now->child[*tmp-'a'];
                now->num ++;
            }
            tmp++;
        }
    }
    while(cin.getline(word,11),cin && word[0])
    {
        int mins=100000;
        struct dictree *now = &root;
        char *tmp = word;
        while(*tmp)
        {
            now=now->child[*tmp-'a'];
            if(!now)
            {
                mins = 0;
                break;
            }
            if(now->num < mins)
                mins = now->num;
            tmp++;
        }
        cout<<mins<<endl;
    }
    return 0;
}

DreamSky 2009-04-09 14:17 发表评论

hdu 1800 Flying to the Mars

DreamSky — Thu, 09 Apr 2009 06:15:00 GMT

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

/*
5
1001
0010
0110
2
4
*/
#include<iostream>
using namespace std;
int i;
struct dictree
{
    struct dictree *child[10];
    int num;
    dictree()
    {
        for(i=0;i<10;i++)
            child[i]=NULL;
        num = 0;
    }
    ~dictree()
    {
        for(i=0;i<10;i++)
            if(child[i])
                delete child[i];
    }
};
int main()
{
    int n;
    while(cin>>n)
    {
        int maxs = 0;
        char digit[31];
        struct dictree root;
        while(n--)
        {
            cin>>digit;
            char *tmp = digit;
            while(*tmp == '0')//��L��前缀0
                tmp++;
            struct dictree *now = &root;
            while(*tmp>='0' && *tmp<='9')//注意不能写成*tmp
            {
                if(now->child[*tmp-'0'] == NULL)
                    now->child[*tmp-'0'] = new dictree;
                now = now->child[*tmp-'0'];
                //now->num++;//不能再加
                tmp++;
            }
            now->num++;
            if( maxs < now->num)
                maxs = now->num;
        }
        cout<<maxs<<endl;
    }
    return 0;
}

DreamSky 2009-04-09 14:15 发表评论