hdoj Flying to the Mars 1800 (DP)

原创 2015年11月17日 17:43:53

Flying to the Mars

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 15114    Accepted Submission(s): 4865


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);

Output
For each case, output the minimum number of broomsticks on a single line.

Sample Input
4 10 20 30 04 5 2 3 4 3 4

Sample Output
1 2
 
//题意: 先输入一个n,表示有n个人,然后是n个人的技能值,技能高的可以当技能低的人的老师, 并且他们可以同坐在一个扫帚上,问最少需要几个扫帚。
//Hiat:题中要求是30位的数,但其实__int64位就够了(数据的漏洞,若真想写够30位,那么就得用哈希表了,不过那个,我还不会)。
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define ll __int64
using namespace std;
ll a[3010];
int b[3010];
int main()
{
	int n,i,j;
	while(scanf("%d",&n)!=EOF)
	{
		for(i=0;i<n;i++)
			scanf("%I64d",&a[i]);
		sort(a,a+n);
		memset(b,0,sizeof(b));
		int mm=0;
		ll tmp;
		for(i=0;i<n;i++)
		{
			if(!b[i])
			{
				
				tmp=a[i];
				b[i]=1;
				for(j=i+1;j<n;j++)
				{
					if(!b[j]&&a[j]>tmp)
					{
						b[j]=1;
						tmp=a[j];
					}
				}
				mm++;
			}
		}
		printf("%d\n",mm);
	}
	return 0;
}

 

[ACM] hdu 3555 Bomb (数位DP,统计1-N中含有“49”的总数)

Bomb Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others) Total S...
  • sr19930829
  • sr19930829
  • 2014年08月08日 20:44
  • 1933

iText和flying saucer结合生成pdf的技术

原博文地址 http://blog.csdn.net/shanliangliuxing/article/details/6833471 下面是我自己利用flying sau...
  • jimmy609
  • jimmy609
  • 2013年10月15日 12:40
  • 18027

HDU2089 不要62(数位DP入门经典题目)

昨天做了一道很奇怪的数字题,不知道怎么做,今天才知道是数位DP ……我来学习学习。 传送门 大意:给定区间[n,m][n,m],求在n到m中没有“62“或“4“的数的个数。如62315包含62,8...
  • geng4512
  • geng4512
  • 2015年08月24日 20:48
  • 1171

hdoj 1800 Flying to the Mars 【贪心】

题目大意:高的人可以教低的人如何骑扫帚,求最小需要买的扫帚数; 策略:因为题目没有说序号排列不可改变,那么从小到大排个序,依次查找比当前高的就可以了; 这道题有点唬人 说数剧最多30位。。。。64位整...
  • shengweisong
  • shengweisong
  • 2014年08月05日 20:14
  • 621

【邻接表字符串Hash】【HDU1800】Flying to the Mars

题意: 给你N个数字,带前导0,问出现最多的数字个数 思路: 读入,清楚前导0,Hash。 用邻接表字符串Hash有一下几点注意 string,不要memset,否则地址也没了,涉及到stl的...
  • zy691357966
  • zy691357966
  • 2015年04月09日 15:18
  • 302

hdu 1800 Flying to the Mars

Flying to the Mars Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Othe...
  • chentian114
  • chentian114
  • 2011年09月24日 11:07
  • 332

HDU 1800 Flying to the Mars 字符串 hash

Flying to the Mars Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Other...
  • qq_33402621
  • qq_33402621
  • 2016年09月29日 16:28
  • 207

hdu 1800 Flying to the Mars(字典树||map||hash)

题目:http://acm.hdu.edu.cn/showproblem.php?pid=1800 给出一堆士兵的等级,等级高的的士兵可以当等级小的士兵的师傅,一个士兵最多一个师傅(可以没有),一个...
  • theArcticOcean
  • theArcticOcean
  • 2015年07月13日 16:42
  • 474

HDU 1800 Flying to the Mars(字符串Hash)

Flying to the Mars
  • dtxm123
  • dtxm123
  • 2016年08月08日 21:58
  • 152

hdu 1800 Flying to the Mars(HashMap水过,可用字典树)

HashMap水过,可用字典树,Scanner输入会超时,用BufferedReader输入
  • u010103075
  • u010103075
  • 2013年08月06日 18:56
  • 1260
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdoj Flying to the Mars 1800 (DP)
举报原因:
原因补充:

(最多只允许输入30个字)