Flying to the Mars

Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 11228 Accepted Submission(s): 3619

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

Author

PPF@JLU

由于数据疲弱，所以其实使用map就可以了，虽然这道题有人为的想卡掉STL做法，但是还存在漏洞。

代码：

 //#define LOCAL

 #include<cstdio>

 #include<cstring>

 #include<iostream>

 #include<map>

 using namespace std;

 map<int,int>aa;

 int main()

 {

  int n,i,maxc,b;

  #ifdef LOCAL

   freopen("test.in","r",stdin);

  #endif

  while(scanf("%d",&n)!=EOF){

     aa.clear();

       maxc=;

     for(i=;i<=n;i++){

       scanf("%d",&b);

       aa[b]++;

      if(maxc<aa[b])maxc=aa[b];

     }

     printf("%d\n",maxc);

  }

   return ;

 }

不过，还是为了练一下手，就是用比较简单的trie树吧！

代码：218ms

 //#define LOCAL

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 typedef struct node

 {

   struct node *child[];

   int id;

 }Trie;

 int max(int a,int b)

 {

   return a>b?a:b;

 }

 int Insert(char *s,Trie *root)

 {

     Trie *cur=root,*curnew;

     int i,pos;

     for(i=;s[i]!='\0';i++)

     {

         pos=s[i]-'';

       if(cur->child[pos]==NULL)

       {

            curnew = new Trie;

          curnew->id=;

          for(int j=;j<;j++)

            curnew->child[j]=NULL;

          cur->child[pos]=curnew;

       }

       cur=cur->child[pos];

     }

      cur->id++;

   return cur->id;

 }

 void del(Trie *root)

 {

     Trie *cur=root;

     for(int i=;i<;i++)

     if(cur->child[i]!=NULL)

        del(cur->child[i]);

    delete cur;

 }

 char bb[];

 int main()

 {

     int n,ans,i;

     #ifdef LOCAL

     freopen("test.in","r",stdin);

     #endif

     Trie *root;

     while(scanf("%d",&n)!=EOF)

     {

       root=new Trie;

      for(i=;i<;i++)

        root->child[i]=NULL;

         ans=;

       while(n--){

         scanf("%s",bb);

         i=;

         while(bb[i]==''&&bb[i+]!='\0')i++;

         ans=max(ans,Insert(bb+i,root));

       }

       printf("%d\n",ans);

       del(root);

     }

  return ;

 }

注意几组数据：

4 004 04 0012 000

3 00 0 000

巴特西

hdu---(1800)Flying to the Mars(trie树)

Flying to the Mars

最新文章

热门文章