杭电1800Flying to the Mars
来源:互联网 发布:java bigdecimal 累加 编辑:程序博客网 时间:2024/06/06 03:15
Flying to the Mars
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9138 Accepted Submission(s): 2978
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
Author
PPF@JLU
就是找重复最多的。。
map:
#include <iostream>#include <map>using namespace std;#include <cstdio>#include <cstring>int n;char stu[50];int main(){ int i,j; while(~scanf("%d",&n)) { getchar(); map<int,int> ss; multimap<int,int> s; for(i=1;i<=n;++i) { scanf("%s%*c",stu); int flag=1; int p=0; for(j=0;j<strlen(stu);++j) { if(stu[j]=='0'&&flag) continue; p*=10; p+=stu[j]-'0'; flag=0; } s.insert(make_pair<int,int>(p,n)); ss.insert(make_pair<int,int>(p,n)); } int sum=-1; map<int,int>::iterator l_it; for(l_it=ss.begin();l_it!=ss.end();++l_it) { int x=s.count(l_it->first); sum=max(x,sum); } printf("%d\n",sum); } return 0;}
set:
#include <iostream>#include <set>using namespace std;#include <cstdio>#include <cstring>int n;char stu[50];int main(){ int i,j; while(~scanf("%d",&n)) { getchar(); set<int> ss; multiset<int> s; for(i=1;i<=n;++i) { scanf("%s%*c",stu); int flag=1; int p=0; for(j=0;j<strlen(stu);++j) { if(stu[j]=='0'&&flag) continue; p*=10; p+=stu[j]-'0'; flag=0; } s.insert(p); ss.insert(p); } int sum=-1; set<int>::iterator l_it; for(l_it=ss.begin();l_it!=ss.end();++l_it) { int x=s.count(*l_it); sum=max(x,sum); } printf("%d\n",sum); } return 0;}
0 0
- 杭电1800-Flying to the Mars
- 杭电1800Flying to the Mars
- 杭电1800Flying to the Mars(简单哈希)
- 杭电 1800 Flying to the Mars(贪心)
- 杭电1800 Flying to the Mars(贪心)
- 杭电 HDU ACM 1800 Flying to the Mars
- 杭电 hdu 1800 Flying to the Mars (水题 STL)
- 1800 Flying to the Mars
- Flying to the Mars
- Flying to the Mars
- Flying to the Mars
- Flying to the Mars
- Flying to the Mars
- Flying to the Mars
- Flying to the Mars
- Flying to the Mars
- Flying to the Mars
- Flying to the Mars
- [树状数组]POJ 2352 Stars
- 数据结构与算法--链栈
- java学习笔记 反射reflection相关知识点小结
- OJ_1009 二叉搜索树
- 数据结构与算法——栈的作用及应用
- 杭电1800Flying to the Mars
- OJ_1010
- maven学习笔记【指定jdk】
- 读《C和指针》 I
- 微型研发团队建设
- OJ_1011 最大连续子序列
- SQL事务
- android_baiduMap(一) ---- 申请百度map key
- Tyvj 八数码