随笔分类 -  ACM(HOJ)题目解题报告

上一页 1 ··· 20 21 22 23 24 25 26 27 下一页

ACM HDU 1248 寒冰王座(水题,用母函数完成的)
摘要:寒冰王座Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4537Accepted Submission(s): 2151Problem Description不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞票(记住,只有一张钞票),为了防止自己在战斗中频繁的死掉,他决定给自己买一些道具,于是他来到了地精商店前.死亡骑士:"我要买道具!"地精商人:"我们这里有三种道具,血瓶150块一个,魔法药200块一个,无敌药水3 阅读全文

posted @ 2011-08-06 13:40 kuangbin 阅读(783) 评论(0) 推荐(0) 编辑

ACM HDU 1142 A Walk Through the Forest(单源最短路,记忆DFS)
摘要:A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2121Accepted Submission(s): 756Problem DescriptionJimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a 阅读全文

posted @ 2011-08-06 12:28 kuangbin 阅读(488) 评论(0) 推荐(0) 编辑

ACM HDU 1217 Arbitrage(Floyed算法)
摘要:ArbitrageTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1186Accepted Submission(s): 547Problem DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same curr 阅读全文

posted @ 2011-08-06 02:25 kuangbin 阅读(2689) 评论(0) 推荐(3) 编辑

ACM HDU 1301 Jungle Roads (简单最小生成树问题)
摘要:Jungle RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1728Accepted Submission(s): 1254Problem DescriptionThe Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages 阅读全文

posted @ 2011-08-06 01:01 kuangbin 阅读(570) 评论(0) 推荐(0) 编辑

ACM HDU 1162 Eddy's picture (简单最小生成树,开始练习使用模板了)
摘要:Eddy's pictureTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2454Accepted Submission(s): 1184Problem DescriptionEddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pictures in his smal 阅读全文

posted @ 2011-08-05 21:45 kuangbin 阅读(1078) 评论(0) 推荐(0) 编辑

ACM HDU 1260 Tickets
摘要:TicketsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 385Accepted Submission(s): 192Problem DescriptionJesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets 阅读全文

posted @ 2011-08-05 10:52 kuangbin 阅读(817) 评论(0) 推荐(0) 编辑

ACM HDU 1176 免费馅饼(DP)
摘要:免费馅饼Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9307Accepted Submission(s): 3011Problem Description都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在 阅读全文

posted @ 2011-08-05 01:11 kuangbin 阅读(619) 评论(0) 推荐(0) 编辑

ACM HUD 1203 I NEED A OFFER!(简单 背包)
摘要:I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6119Accepted Submission(s): 2129Problem DescriptionSpeakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没有多少钱,总共只攒了n万美元。他将在m个学校中选择若干的(当然要在他的 阅读全文

posted @ 2011-08-05 01:10 kuangbin 阅读(565) 评论(0) 推荐(0) 编辑

ACM HDU 1257 最少拦截系统
摘要:最少拦截系统Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5453Accepted Submission(s): 2077Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套 阅读全文

posted @ 2011-08-05 00:05 kuangbin 阅读(1414) 评论(0) 推荐(0) 编辑

ACM HDU 1160FatMouse's Speed
摘要:FatMouse's SpeedTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3610Accepted Submission(s): 1522Special JudgeProblem DescriptionFatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a c 阅读全文

posted @ 2011-08-04 21:34 kuangbin 阅读(2969) 评论(6) 推荐(0) 编辑

ACM HDU 1114 Piggy-Bank (完全背包问题)
摘要:Piggy-BankTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2795Accepted Submission(s): 1379Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes f 阅读全文

posted @ 2011-08-04 20:04 kuangbin 阅读(4857) 评论(0) 推荐(2) 编辑

ACM HDU 1074 Doing Homework(位运算,搜索,状态压缩DP)
摘要:Doing HomeworkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1950Accepted Submission(s): 685Problem DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of han 阅读全文

posted @ 2011-08-04 16:56 kuangbin 阅读(3523) 评论(1) 推荐(2) 编辑

HDU 1087 Super Jumping! Jumping! Jumping! (求最大上升子序列和,动态规划)
摘要:Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9053Accepted Submission(s): 3693Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good 阅读全文

posted @ 2011-08-04 15:19 kuangbin 阅读(511) 评论(0) 推荐(0) 编辑

ACM HDU 1069 Monkey and Banana (动态规划)
摘要:Monkey and BananaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2599Accepted Submission(s): 1345Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, an 阅读全文

posted @ 2011-08-04 14:09 kuangbin 阅读(5312) 评论(0) 推荐(2) 编辑

HDU 1231 最大连续子序列(和HDU1003 Max Sum类似的)
摘要:最大连续子序列Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7999Accepted Submission(s): 3335Problem Description给定K个整数的序列{ N1, N2, ..., NK },其任意连续子序列可表示为{ Ni, Ni+1, ..., Nj },其中 1 <= i <= j <= K。最大连续子序列是所有连续子序列中元素和最大的一个, 例如给定序列{ -2, 11, -4, 13, 阅读全文

posted @ 2011-08-04 12:42 kuangbin 阅读(559) 评论(0) 推荐(0) 编辑

HDU 1024 Max Sum Plus Plus(动态规划,给定一个数组,求其分成m个不相交子段和最大值的问题)
摘要:Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6725Accepted Submission(s): 2251Problem DescriptionNow I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves t 阅读全文

posted @ 2011-08-04 11:10 kuangbin 阅读(14947) 评论(1) 推荐(7) 编辑

HDU 1003 Max Sum(连续子列的最大和,动态规划)
摘要:Max SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 55792Accepted Submission(s): 12580Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max 阅读全文

posted @ 2011-08-04 10:12 kuangbin 阅读(513) 评论(0) 推荐(0) 编辑

Triple ACM HDU 3908 (数学题,找多少种组合)
摘要:TripleTime Limit: 5000/3000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 387Accepted Submission(s): 153Problem DescriptionGiven many different integers, find out the number of triples (a, b, c) which satisfy a, b, c are co-primed each other or are not co-primed each 阅读全文

posted @ 2011-08-03 15:09 kuangbin 阅读(693) 评论(0) 推荐(0) 编辑

Swordsman ACM HDU 3902(判断n边形是不是轴对称图形,暴力求解了~~~~)
摘要:SwordsmanTime Limit: 10000/4000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 308Accepted Submission(s): 116Problem DescriptionMr. AC is a swordsman. His dream is to be the best swordsman in the world. To achieve his goal, he practices every day. There are many ways 阅读全文

posted @ 2011-08-03 14:47 kuangbin 阅读(1174) 评论(0) 推荐(0) 编辑

ACM HDU 1236 排名(简单水题)
摘要:排名Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7425Accepted Submission(s): 2796Problem Description今天的上机考试虽然有实时的Ranklist,但上面的排名只是根据完成的题数排序,没有考虑 每题的分值,所以并不是最后的排名。给定录取分数线,请你写程序找出最后通过分数线的 考生,并将他们的成绩按降序打印。 Input测试输入包含若干场考试的信息。每场考试信息的第1行给出考生人数N ( 0 &l 阅读全文

posted @ 2011-08-02 19:08 kuangbin 阅读(2321) 评论(0) 推荐(0) 编辑

上一页 1 ··· 20 21 22 23 24 25 26 27 下一页

导航

JAVASCRIPT: