字典树+map+hdu1800

Online Judge Online Exercise Online Teaching Online Contests Exercise Author F.A.Q Hand In Hand Online Acmers Forum | Discuss Statistical Charts Problem Archive Realtime Judge Status Authors Ranklist         C/C++/Java Exams      ACM Steps Go to Job Contest LiveCast ICPC@China Best Coder beta VIP | STD Contests Virtual Contests      DIY | Web-DIY beta Recent Contests  lee  Mail 0(0)  Control Panel   Sign Out

[BestCoder Round #5]冠军的奖励是小米3手机一部  恭喜福州大学杨楠获得[BestCoder Round #4]冠军（iPad Mini一部）  《BestCoder用户手册》下载

Flying to the Mars Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 11077    Accepted Submission(s): 3566 Problem Description In the year 8888, the Earth is ruled by the PPF Empire . As the population growing , PPF needs to find more land for the newborns . Finally , PPF decides to attack Kscinow who ruling the Mars . Here the problem comes! How can the soldiers reach the Mars ? PPF convokes his soldiers and asks for their suggestions . “Rush … ” one soldier answers. “Shut up ! Do I have to remind you that there isn’t any road to the Mars from here!” PPF replies. “Fly !” another answers. PPF smiles :“Clever guy ! Although we haven’t got wings , I can buy some magic broomsticks from HARRY POTTER to help you .” Now , it’s time to learn to fly on a broomstick ! we assume that one soldier has one level number indicating his degree. The soldier who has a higher level could teach the lower , that is to say the former’s level > the latter’s . But the lower can’t teach the higher. One soldier can have only one teacher at most , certainly , having no teacher is also legal. Similarly one soldier can have only one student at most while having no student is also possible. Teacher can teach his student on the same broomstick .Certainly , all the soldier must have practiced on the broomstick before they fly to the Mars! Magic broomstick is expensive !So , can you help PPF to calculate the minimum number of the broomstick needed . For example :   There are 5 soldiers (A B C D E)with level numbers : 2 4 5 6 4; One method : C could teach B; B could teach A; So , A B C are eligible to study on the same broomstick. D could teach E;So D E are eligible to study on the same broomstick; Using this method , we need 2 broomsticks. Another method: D could teach A; So A D are eligible to study on the same broomstick. C could teach B; So B C are eligible to study on the same broomstick. E with no teacher or student are eligible to study on one broomstick. Using the method ,we need 3 broomsticks. …… After checking up all possible method, we found that 2 is the minimum number of broomsticks needed.     Input Input file contains multiple test cases.   In a test case,the first line contains a single positive number N indicating the number of soldiers.(0<=N<=3000) Next N lines :There is only one nonnegative integer on each line , indicating the level number for each soldier.( less than 30 digits);   Output For each case, output the minimum number of broomsticks on a single line.   Sample Input 4 10 20 30 04 5 2 3 4 3 4   Sample Output 1 2

题意：求最少有多少个上升子序列

思路：其实就是求出现最多的数出现了几次。因为有30位，所以可以hash，也可以用字典树，map时间会很长

map代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
int n;
string s;
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        map<string,int> m;
        int ans=0;
        for(int i=0;i<n;i++)
        {
            cin>>s;
            int len=s.size();
            for(int j=0;j<len;j++)
            {
                if(s[j]!='0'||j==len-1)
                {
                    string tmp=s.substr(j,len);
                    int cnt=(++m[tmp]);
                    if(ans<cnt)ans=cnt;
                    break;
                }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}

字典树代码：

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
int n,ans;
char s[40];
struct TRIE
{
    int ch[3000*30*10][10];
    int val[3000*30*10];
    int sz;
    void clear(){memset(ch[0],0,sizeof(ch[0]));sz=1;}
    int idx(char x){return x-'0';}
    void insert(char *s)
    {
        int n=strlen(s);
        int u=0;
        for(int i=0;i<n;i++)
        {
            int c=idx(s[i]);
            if(!ch[u][c])
            {
                memset(ch[sz],0,sizeof(ch[sz]));
                val[sz]=0;
                ch[u][c]=sz++;
            }
            u=ch[u][c];
        }
        val[u]++;

        ans=max(ans,val[u]);
    }
}tree;
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        tree.clear();
        ans=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%s",s);
            int len=strlen(s);
            for(int j=0;j<len;j++)
                if(s[j]!='0'||j==len-1)
                {
                    tree.insert(s+j);
                    break;
                }
        }
        printf("%d\n",ans);
    }
    return 0;
}