杭电1800
2014-02-02 03:04
344 查看
Flying to the Mars
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9103 Accepted Submission(s): 2960
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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);
[align=left]Output[/align]
For each case, output the minimum number of broomsticks on a single line.
[align=left]Sample Input[/align]
4
10
20
30
04
5
2
3
4
3
4
[align=left]Sample Output[/align]
1
2
只能说 要注意有全0的数据;如:500000000
#include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> using namespace std; struct node { node *x[10]; int cnt; }; node *tree; int sum,n; char stu[40]; void create(node *&t) { int i; t=(node *)malloc(sizeof(node)); t->cnt=0; for(i=0;i<10;++i) t->x[i]=NULL; } void insertTree(char *stu) { node *f=tree; int i,j,len=strlen(stu); for(i=0;i<len;++i) { int p=stu[i]-'0'; if(f->x[p]==NULL) { f->x[p]=(node *)malloc(sizeof(node)); f=f->x[p]; f->cnt=0; for(j=0;j<10;++j) f->x[j]=NULL; if(i==len-1) f->cnt=1; } else { f=f->x[p]; if(i==len-1) f->cnt++; } } //f->cnt++; sum=max(sum,f->cnt); } void deleteTree(node *&tree) { int i; for(i=0;i<10;++i) { if(tree->x[i]!=NULL) deleteTree(tree->x[i]); } free(tree); } int main() { int i,j; while(~scanf("%d",&n)) { getchar(); create(tree); sum=0; for(i=1;i<=n;++i) { scanf("%s",stu);getchar(); j=0; while(stu[j]=='0') ++j; if(j==strlen(stu))//防止全为0 j=strlen(stu)-1; insertTree(stu+j); } printf("%d\n",sum); deleteTree(tree); } return 0; }
相关文章推荐
- paip.基于navicate mysql的自动化报表工具总结
- paip.基于navicate mysql的自动化报表工具总结
- Confluence 编辑器 添加大纲列表
- UVa 465 溢出
- Linux进程间通信——信号集函数
- 支持O(1)时间增加,删除和随机选择操作的数据结构
- 我与GitHub的第一次――自制音乐文件修改器
- Android Application对象必须掌握的七点
- 我与GitHub的第一次——自制音乐文件修改器
- 我与GitHub的第一次——自制音乐文件修改器
- 我与GitHub的第一次——自制音乐文件修改器 分类: ASP.NET 2014-02-02 02:19 15092人阅读 评论(24) 收藏
- 我与GitHub的第一次——自制音乐文件修改器
- fedora20安装virtualbox
- Spark调优
- 用AS3编写的具有将多段视频连起来播放的 flash视频播放器---003
- liunx DHCP 的搭建
- Android中自定义ListView
- Titan execution map - for openstack
- Filter(二)——Java利用FileFilter过滤文件
- Filter(二)——Java利用FileFilter过滤文件