HDU 1800 Flying to the Mars
来源:互联网 发布:红蜘蛛电子教学软件 编辑:程序博客网 时间:2024/05/23 13:08
Flying to the Mars
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20664 Accepted Submission(s): 6649
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
/***类型:贪心算法**题目来源:NYOJ**时间:2017/7/30**解决方案:*//***类型:贪心算法**题目来源:NYOJ**时间:2017/7/30**解决方案:*/# include <stdio.h> # include <string.h> # include <stdlib.h> char s[3010][35] ; //qsort 字符数组排序 int cmp(const void *a, const void *b) { return strcmp((char*)a, (char*)b) ; } int main () { int n, i, j ; int count, mark ; while (scanf ("%d", &n)!=EOF) { for (i = 0 ; i < n ; i++) { scanf ("%s", s[i]) ; for (j = 0 ; s[i][j] == '0' ; j++); //去掉字符串的前导0 strcpy (s[i], s[i]+j) ; } qsort(s, n, sizeof(s[0]), cmp) ; mark = 0 ;count = 0 ; for (i = 1 ; i < n ; i++) { if (strcmp(s[i], s[i-1])==0) //做标记寻找出现相同字符串最多的情况 mark++ ; else { if (mark > count) //标记值得最大赋值于计数器{count = mark ; } mark = 0 ; //重置于零 } } if (mark > count ) count = mark ; //最后连续几个数字相同情况 printf ("%d\n",count+1) ; } return 0 ; }
阅读全文
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
- 关于ExecuteNonQuery() 方法
- QQ空间技巧分析大全!
- Handler详解
- 面试记录,加油!(停更)
- 剑指offer 之 包含min函数的栈
- HDU 1800 Flying to the Mars
- 关于gis坐标中的ZM
- 题目学习——HDUOJ-2674
- eclipse oxygen4.7.0 bug: jsp html 标签Option 嵌入jsp标签如<c:if>报错
- 双向链表的简单实现
- dubbo常见错误
- html css与html交互的4种方式
- 单词搜索迷宫
- 工作一年总结之一项目环境搭建