HDU 1800 Flying to the Mars
来源:互联网 发布:淘宝网官方下载ipad版 编辑:程序博客网 时间:2024/04/29 19:25
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
410203004523434Sample Output12可以用贪心 但是想一想 LV高的可以帮LV低的而且扫把不限人 那么你找到同等级最多的人出来 不就是答案了吗#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 33;
}//找最多相同的数 因为不能共用
0 0
- Flying to the Mars (hash) 1800 hdu
- hdu 1800 Flying to the Mars
- Hdu-1800 Flying to the Mars
- hdu 1800 Flying to the Mars
- hdu 1800 Flying to the Mars
- HDU-1800-Flying to the Mars
- hdu 1800 Flying to the Mars
- hdu 1800 Flying to the Mars
- hdu 1800 Flying to the Mars
- HDU 1800 Flying to the Mars
- HDU 1800 Flying to the Mars STL
- HDU -1800 Flying to the Mars
- hdu - 1800 - Flying to the Mars
- HDU 1800 Flying to the Mars(trie)
- HDU--1800 -- Flying to the Mars
- HDU-1800 - Flying to the Mars
- hdu 1800 Flying to the Mars【水水】
- HDU 1800 Flying to the Mars
- 日经社説 20150714 中国の弁護士拘束を憂慮する
- 第七周
- 牛人博客汇总之摘抄三
- 做了三年的移动APP测试,谈一下基本的测试流程和方法
- 函数堆栈,存储类型,作用域,连接类型
- HDU 1800 Flying to the Mars
- 日经社説 20150714 ギリシャ支援の最終合意へ機を逃すな
- 最优化学习笔记(三)最速下降法
- UIWindow 使用
- 005-Scala数组操作实战详解
- js跳转页面的几种方式
- 第八周
- Android开发:shape和selector和layer-list的(详细说明)
- DEX文件结构