hud
文章平均质量分 77
小韩boke
长不大的人,学不完的习;
立不完的志,想不完的事;
干不完的活,挣不完的钱。
人在,责任在;
心动,不如行动。
展开
-
hdu 1874畅通工程再续(最短路径)
Problem Description某省自从实行了很多年的畅通工程计划后,终于修建了很多路。不过路多了也不好,每次要从一个城镇到另一个城镇时,都有许多种道路方案可以选择,而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在,已知起点和终点,请你计算出要从起点到终点,最短需要行走多少距离。 Input本题目包含多组数据,请处理到文件结束。每组数据第一转载 2014-12-13 15:48:30 · 507 阅读 · 0 评论 -
hd2079(选课时间)(母函数)
选课时间Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3266 Accepted Submission(s): 2564Problem Description又到了选课的时间了,xhd看着选课表发呆,为了想让转载 2015-04-07 21:14:52 · 390 阅读 · 0 评论 -
敌兵布阵(线段树)
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 51221 Accepted Submission(s): 21441Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以转载 2015-04-01 17:03:13 · 317 阅读 · 0 评论 -
最少步数(广搜)
最少步数时间限制:3000 ms | 内存限制:65535 KB难度:4描述这有一个迷宫,有0~8行和0~8列: 1,1,1,1,1,1,1,1,1 1,0,0,1,0,0,1,0,1 1,0,0,1,1,0,0,0,1 1,0,1,0,1,1,0,1,1 1,0,0,0,0,1,0,0,1 1,1,0,1,0,1,0,0,1原创 2015-04-02 22:49:36 · 908 阅读 · 0 评论 -
hd素数回文
素数回文Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13008 Accepted Submission(s): 2988Problem Descriptionxiaoou33对既是素数又是回文的数特别感兴趣转载 2015-03-23 22:46:58 · 641 阅读 · 1 评论 -
Color the ball
Color the ball Time Limit : 9000/3000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 10 Accepted Submission(s) : 6Font: Times New Roman | Verdana | Georgia Fo转载 2015-03-30 22:26:45 · 536 阅读 · 1 评论 -
Monkey and Banana(动归)
Monkey and BananaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8609 Accepted Submission(s): 4451Problem DescriptionA group of r原创 2015-03-30 20:20:47 · 335 阅读 · 0 评论 -
hd2063过山车
过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12794 Accepted Submission(s): 5613Problem DescriptionRPG girls今天和大家一起去游乐场玩,终于可转载 2015-03-22 12:08:27 · 606 阅读 · 0 评论 -
Rescue(广度优先搜索)
RescueProblem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save Angel. Their task is: approach转载 2015-03-28 00:10:32 · 589 阅读 · 0 评论 -
hd 2553N皇后问题(深搜,回溯)
N皇后问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10350 Accepted Submission(s): 4660Problem Description在N*N的方格棋盘放置了N个皇后,使得它们不相转载 2015-03-16 19:00:45 · 361 阅读 · 0 评论 -
A sequence of numbers (二分幂)
A sequence of numbersProblem DescriptionXinlv wrote some sequences on the paper a long time ago, they might be arithmetic or geometric sequences. The numbers are not very clear now, and only the f原创 2015-03-25 14:04:23 · 354 阅读 · 0 评论 -
Tree(并查集)
TreeTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1771 Accepted Submission(s): 517Problem DescriptionThere are N (2<=N<=600) ci原创 2015-03-25 20:41:35 · 344 阅读 · 0 评论 -
hdu 2209 翻纸牌游戏(dfs)
Problem Description有一种纸牌游戏,很有意思,给你N张纸牌,一字排开,纸牌有正反两面,开始的纸牌可能是一种乱的状态(有些朝正,有些朝反),现在你需要整理这些纸牌。但是麻烦的是,每当你翻一张纸牌(由正翻到反,或者有反翻到正)时,他左右两张纸牌(最左边和最右边的纸牌,只会影响附近一张)也必须跟着翻动,现在给你一个乱的状态,问你能否把他们整理好,使得每张纸牌都正面朝上,如果可以,最转载 2014-12-12 22:05:46 · 434 阅读 · 0 评论 -
hdu 2602 Bone Collector(简单背包01)
Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave原创 2014-12-07 16:31:53 · 358 阅读 · 0 评论 -
杭电4496D-City
D-CityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2147 Accepted Submission(s): 758Problem DescriptionLuxer is a really bad gu转载 2015-04-24 23:18:44 · 354 阅读 · 0 评论