hdu 1800 Flying to the Mars
2016-05-08 11:22
531 查看
Flying to the Mars
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16329 Accepted Submission(s): 5254
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
#include<stdio.h> #include<stdlib.h> int a[3000]; int cmp(const void *p1,const void *p2){ return *(int *)p2-*(int *)p1; } int main(){ int n,i; while(scanf("%d",&n)!=EOF){ int max=1,t=1; for(i=0;i<n;i++) scanf("%d",&a[i]); qsort(a,n,sizeof(a[0]),cmp); for(i=0;i<n-1;i++){ if(a[i]==a[i+1]) t++; //如果相等,多一个 else t=1; if(max<t) max=t;//比较最多重复的个数 } printf("%d\n",max); } return 0; }
相关文章推荐
- Android数据加密之Rsa加密
- 集合框架--List常用子类
- 最短路径(bellman算法详解)
- Matlab学习 之 linear regression
- Prototype使用Template
- Compile FreeCAD on Windows
- codeforces 673B B. Problems for Round(模拟)
- 如何在服务器重新启动后继续使用session
- 上古时代 Objective-C 中哈希表的实现
- 集合框架--ListIterator接口
- 一个二叉排序树的实际例子
- 使用openframeworks无需配置学习新版本opengl 之二 使用自带载入图片
- Java中的Integer和int等包装类和基本数据类型简单比较
- 函数对象状态(Function Object State)获取 -- 引用传递和for_each()
- c++作业5
- hdu 2042 不容易系列之二
- Linux下python升级步骤【升级python各种问题,拟合整理】
- Sublime Text 3.0缺失Package Settings和Package Control菜单项
- Android 设置系统的返回键 和软键盘获取焦点问题
- Prototype使用Event