Flying to the Mars(hdu1800,水题排序)
来源:互联网 发布:java public abstract 编辑:程序博客网 时间:2024/06/05 03:49
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=28508#problem/C
http://acm.hdu.edu.cn/showproblem.php?pid=1800
Flying to the Mars
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8401 Accepted Submission(s): 2728
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
Recommend
lcy
解析:
题意:
成绩好的人可以帮助成绩差的人,并且他们可以分配到同一个班。但是是一帮一;
问最少需要多少个班。
思路:
把成绩排序,找出成绩相同的最大人数就是答案了。(因为是一帮一,水平相同的不可以互帮,必然要被分配到不同班级)
240 KB 203 ms C++ 597 B 2013
*/
#include<stdio.h>#include<stdlib.h>#include<string.h>#include<math.h>#include<algorithm>#include <iostream>using namespace std;const int maxn=3000+10;int a[maxn];int main(){ int n,i,j,ans; while(scanf("%d",&n)!=EOF) { if(n==0) { printf("0\n"); continue; } for(i=0;i<n;i++) { scanf("%d",&a[i]); } sort(a,a+n); ans=1; int t1,t=0; for(i=1;i<n;i++) { t1=0; if(a[i]==a[i-1]) {t1++; while(a[i]==a[i-1]&&i<n) {t1++; i++; } }if(ans<t1)ans=t1; } printf("%d\n",ans); } return 0;}
- Flying to the Mars(hdu1800,水题排序)
- HDU1800 Flying to the Mars(贪心)
- Flying to the Mars HDU1800 map 简单水题
- hdu1800 Flying to the Mars(map水)
- HDU1800 Flying to the Mars
- HDU1800 Flying to the Mars
- HDU1800-Flying to the Mars
- hdu1800 Flying to the Mars
- HDU1800——Flying to the Mars(map+贪心)
- hdu1800 Flying to the Mars(字典树)
- hdu1800 Flying to the Mars(map)
- 【字典树】 hdu1800 Flying to the Mars
- hdu1800 Flying to the Mars (字典树)
- hdu1800 Flying to the Mars ELFHash/BKDHash
- HDU1800 Flying to the Mars 【贪心】
- Hdu1800 - Flying to the Mars - 字典树
- HDU1800 Flying to the Mars【字典树】
- HDU1800 Flying to the Mars Tire树
- POJ1328-贪心-区间选点问题
- spring Scurity终于测试OK了,复杂的功能还待深入研究!发布出来一起探讨吧!
- opencv 显示播放视频
- hdu2161 Primes
- Building bridges_hdu_4584(排序).java
- Flying to the Mars(hdu1800,水题排序)
- 找出一个字符串中出现的重复的最长的字符子串
- TOJ 1752 POJ 2255 Tree Recovery
- C++ 初始化成员列表
- To the Max(poj1050,最大连续和)
- 项目总结——谈谈封装(抽象工厂+反射+缓存机制)
- Cuts the cake_hdu_2134.java
- hdu 题目 1384 Wall(凸包)
- 腾讯笔试题:猜字游戏---猜1-100之间一个数字,最少多少次?第一次猜的数是几?