Flying to the Mars
2016-05-24 15:05
423 查看
题目描述
![](http://acm.hdu.edu.cn/data/images/1800-1.jpg)
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 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);
输出
For each case, output the minimum number of broomsticks on a single line.
样例输入
4 10 20 30 04 5 2 3 4 3 4
样例输出
1 2
AC代码:
#include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<cmath> #include<map> using namespace std; int main() { int n,i,j,k; map<int ,int>m; while(~scanf("%d",&n)){ m.clear(); k=INT_MIN; for(i=0;i<n;i++){ scanf("%d",&j); m[j]++; k=max(m[j],k); } printf("%d\n",k); } return 0; }
相关文章推荐
- linux 混杂设备miscdevice
- vector 二维
- matlab求凸包
- STL之string
- java基础第十天_集合
- Java中遭遇NaN
- IT项目管理之沉没成本
- Oracle EBS 供应商分行创建
- 简单的Socket示例
- 线段树(建树,查询)
- 网络通信之HTTP
- An internal error occurred during: "SVN 更新". 3
- 提醒下自己
- CSS3 对话气泡
- Linux里如何查找文件内容
- activiti模型导出——衍生response响应方式解析
- 一张图告诉你为啥要学C++
- NT KERNEL & SYSTEM 进程占用 80 端口导致 Nginx 启动失败
- 可靠的Windows版Redis
- Oracle EBS 供应商银行创建