hdu 1800 Flying to the Mars(map简单题)
2016-03-21 09:40
441 查看
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
我们可以进行分组,因为level值高的才可以教导低的,所以相同level的人不会在同一组,由此我们可以通过求同一level人数的最大值来求解。
#include<iostream> #include<map> using namespace std; int main(){ int N; int level; while(cin>>N){ map<int,int> mp; int max=0; for(int i=0;i<N;i++){ scanf("%d",&level); mp[level]++; if(mp[level]>max) max=mp[level]; } printf("%d\n",max); } }
相关文章推荐
- 互斥量与临界区的区别
- Cookie学习笔记
- 如何看待SEO中原创文章的作用
- Gradle 入门指南中文版
- 关于eth的一些操作
- 为什么使用React
- HTML笔试题 20道单选
- 推荐系统 相关资料收集
- Android Studio连接真机没反应
- Java排序算法(三)--归并排序(MergeSort)递归与非递归的实现
- 轻量级数据交换格式 JSON for C++
- LeetCode Patching Array
- 谈谈HtmlControl与WebControl的区别与用途
- 最长回文子串
- FireFox Chrome 等浏览器不能访问localhost
- 代码重构(五):继承关系重构规则
- android jni基本使用方式
- Codeforces Round #345 (Div. 2) B. Beautiful Paintings
- android webview
- Objective-C和Java的简单对比