HDU--1800 -- Flying to the Mars
来源:互联网 发布:在阿里巴巴找淘宝客户 编辑:程序博客网 时间:2024/04/28 17:33
Flying to the Mars
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8319 Accepted Submission(s): 2692
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);
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
410203004523434
Sample Output
12
Code:
#include"cstdio"#include"cstring"#include"algorithm"using namespace std;int main(){int N,level[3001],sign[3001];int t,i,j,num=0,temp;while(scanf("%d",&N)!=EOF){num = 0;memset(sign,1,sizeof(sign));//标志位置为1,有过扫把的置为0 for(i=1;i<=N;i++)scanf("%d",&level[i]);sort(level+1,level+N+1);//排序 for(i=1;i<=N;i++) {if(sign[i])//没有扫把的才参与比较{sign[i]=0; temp = level[i];for(j=i;j<=N;j++)//从当前位到末尾找出比该位大的所有数并置为0 {if(sign[j])if(level[j]>temp){temp = level[j];sign[j] = 0;}}num++;//扫把++ }}printf("%d\n",num);}}
- 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
- 多校联赛2 Problem2 Warm up 求桥的数目+缩点后的树的直径 当时被不知道原因的爆栈爆到无语了。。
- 常用正则表达式大全
- 网易回应养猪欠债风波:猪场勘探费极不合理
- UVA 573 - The Snail(数学)
- ZOJ 3365
- HDU--1800 -- Flying to the Mars
- io的总结
- dataGridView鼠标移至变色
- linux学习方法之二
- 获取本机多个摄像头(aforge)
- IOS提示控件UIActionSheet,UIAlertView
- Android APK反编译详解(附图) .
- zoj 3688 The Review Plan II 组合数学
- @synthesize obj=_obj的意义详解 @property和@synthesize