HDOJ 1800 Flying to the Mars
2015-12-20 10:36
309 查看
Flying to the Mars
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15422 Accepted Submission(s): 4953
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
题目意思: 10 有n个士兵每个人有一个水平值,水平高的的人可以教低的人,意思就是求最少的扫帚, 11 那么我们只要知道找到最大重复元素的次数即可,因为相同的人肯定不能共用一个, 12 所以求得最少即为最大的重复次数
#include <cstdio> #include <cstring> #include <algorithm> using namespace std; int main(){ int n, i, max, t; int a[3005]; while (scanf("%d", &n) != EOF){ for (i = 0; i < n; i++) scanf("%d", &a[i]); sort(a, a + n); max = 1; t = 1; for (i = 1; i < n; i++){ if (a[i] != a[i - 1]) t = 1; else ++t; if (t > max) max = t; } printf("%d\n", max); } return 0; }
相关文章推荐
- 关于win8/win8.1系统不能调节亮度的解决办法
- Spring MVC学习
- cocoapods 安装
- php 安装gd模块
- 云计算应用网络平台按内蒙古区域和行业划分来创建和管理
- 教你用ps给自己头像p圣诞帽
- [javase学习笔记]-6.6 基本数据类型参数与引用数据类型参数的传递过程
- 一张图说明CDN网络的原理
- VMware Virtual Volume(VVOL)简介
- C#代码实现对AES加密解密
- online_judge_1113
- web统一资源定位符
- Struts工作流程
- 关于产品推荐的10个问题
- 从大数据菜鸟走上大师的历程
- 重载运算符 http://www.nowcoder.com/profile/380772/test/2198787/2593?onlyWrong=0
- Scala中的本地函数与作为语言一等公民的函数详解
- JDK的安装和Java环境变量配置
- 深入分析JavaWeb Item29 -- 使用JDBC处理大数据(MySql + Oracle)
- Translation