2013年8月
文章平均质量分 58
lrbj
这个作者很懒,什么都没留下…
展开
-
Balanced Lineup(poj3264,线段树入门)
/*http://poj.org/problem?id=3264Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 28613 Accepted: 13461Case Time Limit: 2000MSDescriptionFor the daily milking, Far原创 2013-08-15 09:57:18 · 691 阅读 · 0 评论 -
Power Strings(poj2406 ,简单KMP)
http://poj.org/problem?id=2406http://acm.hdu.edu.cn/webcontest/contest_showproblem.php?cid=5412&pid=1008&ojid=1Power StringsTime Limit : 6000/3000ms (Java/Other) Memory Limit : 131072/65原创 2013-08-14 20:30:07 · 655 阅读 · 0 评论 -
Dungeon Master(poj2251,bfs)
http://poj.org/problem?id=2251http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=15203Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u[Submit]原创 2013-08-14 20:55:55 · 535 阅读 · 0 评论 -
Dungeon Master(poj2251,bfs)
http://poj.org/problem?id=2251http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=15203Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u[Submit]原创 2013-08-14 20:57:28 · 553 阅读 · 0 评论 -
Tempter of the Bone(hdu1010,dfs)
http://acm.hdu.edu.cn/showproblem.php?pid=1010Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 53685 Accepted Submi原创 2013-08-15 09:10:55 · 564 阅读 · 0 评论 -
Permutations(hdu2369,置换群)
http://poj.org/problem?id=2369PermutationsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2384 Accepted: 1235DescriptionWe remind that the permutation of some final set is a one-原创 2013-08-15 09:17:49 · 933 阅读 · 0 评论 -
- 敌兵布阵(hdu1165,裸的线段or树状数组)
/*http://acm.hdu.edu.cn/showproblem.php?pid=1166http://acm.hust.edu.cn/vjudge/contest/view.action?cid=28938#problem/CC - 敌兵布阵Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64原创 2013-08-14 20:22:54 · 683 阅读 · 0 评论 -
Atlantis(hdu1151,求面积并,线段树+离散化+扫描)
/*http://poj.org/problem?id=1151AtlantisTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14468 Accepted: 5551DescriptionThere are several ancient Greek texts that contain desc原创 2013-08-15 10:00:48 · 620 阅读 · 0 评论 -
Ignatius and the Princess III(hdu1028,母函数之整数划分)
http://acm.hdu.edu.cn/showproblem.php?pid=1028Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10061 Acce原创 2013-08-15 10:14:57 · 925 阅读 · 0 评论 -
Cable master(hdu1551,二分查找)
http://acm.hdu.edu.cn/showproblem.php?pid=1551Cable masterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1324 Accepted Submission(s)原创 2013-08-15 10:20:52 · 1060 阅读 · 0 评论 -
龟兔赛跑(hdu2059,dp or贪心)
/*http://acm.hdu.edu.cn/showproblem.php?pid=2059http://acm.hust.edu.cn/vjudge/contest/view.action?cid=28938#problem/EE - 龟兔赛跑Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64原创 2013-08-14 20:24:26 · 854 阅读 · 0 评论 -
Ignatius and the Princess I(hdu1026,带权值的bfs)
/*http://acm.hdu.edu.cn/showproblem.php?pid=1026Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9969 A原创 2013-08-14 20:16:40 · 1079 阅读 · 0 评论 -
Fruit(hdu2152,母函数)
http://acm.hdu.edu.cn/showproblem.php?pid=2152http://acm.hust.edu.cn/vjudge/contest/view.action?cid=28708#problem/EE - FruitTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d &原创 2013-08-15 10:17:17 · 706 阅读 · 0 评论 -
Wooden Sticks(hdu1051,LIS)
http://acm.hdu.edu.cn/showproblem.php?pid=1051Wooden SticksTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9167 Accepted Submission(s原创 2013-08-15 10:19:39 · 723 阅读 · 0 评论 -
Coins(poj3210,推论题)
/*http://poj.org/problem?id=3210CoinsTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 6532 Accepted: 4271DescriptionSnoopy has three coins. One day he tossed them on a table原创 2013-08-14 20:19:07 · 902 阅读 · 0 评论 -
Oulipo (poj3461,简单KMP)
http://poj.org/problem?id=3461http://acm.hdu.edu.cn/webcontest/contest_showproblem.php?cid=5412&pid=1004&ojid=1Oulipo Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java原创 2013-08-14 20:31:47 · 632 阅读 · 0 评论 -
Shortest Prefixes(poj2001,tire树)
http://poj.org/problem?id=2001Shortest PrefixesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 11343 Accepted: 4816DescriptionA prefix of a string is a substring starting at the原创 2013-08-14 20:34:37 · 700 阅读 · 0 评论 -
Long Long Message(poj2274,后缀数组入门)
http://poj.org/problem?id=2774Long Long MessageTime Limit: 4000MS Memory Limit: 131072KTotal Submissions: 17682 Accepted: 7196Case Time Limit: 1000MSDescriptionThe little cat is majoring原创 2013-08-14 20:51:10 · 950 阅读 · 0 评论 -
Sum It Up(hdu1258,dfs)
http://acm.hdu.edu.cn/showproblem.php?pid=1258Sum It UpTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3101 Accepted Submission(s): 1原创 2013-08-15 09:07:30 · 650 阅读 · 0 评论 -
Asteroids!(hdu1240,dfs)
http://acm.hdu.edu.cn/showproblem.php?pid=1240Asteroids!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2636 Accepted Submission(s):原创 2013-08-15 09:08:39 · 753 阅读 · 0 评论 -
Just a Hook(hdu1698,线段树)
/*http://acm.hdu.edu.cn/showproblem.php?pid=1698Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12373 Accepted Submission(原创 2013-08-15 09:52:48 · 747 阅读 · 0 评论 -
Vases and Flowers(hdu4614,线段树+二分查找)
http://acm.hdu.edu.cn/showproblem.php?pid=4614Vases and FlowersTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 685 Accepted Submissio原创 2013-08-15 09:55:28 · 1229 阅读 · 0 评论 -
Design T-Shirt(hdu1031,简单排序)
http://acm.hdu.edu.cn/showproblem.php?pid=1031Design T-ShirtTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4164 Accepted Submission(原创 2013-08-15 10:21:55 · 939 阅读 · 0 评论 -
Doing Homework again(hdu1789,贪心)
http://acm.hdu.edu.cn/showproblem.php?pid=1789http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29256#problem/AA - Doing Homework againTime Limit:1000MS Memory Limit:32768KB 64bit原创 2013-08-17 11:45:40 · 634 阅读 · 0 评论 -
Flying to the Mars(hdu1800,水题排序)
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=28508#problem/Chttp://acm.hdu.edu.cn/showproblem.php?pid=1800Flying to the MarsTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 327原创 2013-08-16 21:07:45 · 672 阅读 · 0 评论 -
Seaside(hdu3665,floyd)
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29015#problem/Chttp://acm.hdu.edu.cn/showproblem.php?pid=3665SeasideTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K原创 2013-08-17 23:00:56 · 654 阅读 · 0 评论 -
六度分离(hdu1869,floyd最短路)
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29015#problem/Dhttp://acm.hdu.edu.cn/showproblem.php?pid=1869六度分离Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Ja原创 2013-08-17 22:57:45 · 888 阅读 · 0 评论 -
最短路(hdu2544,floyd最短路)
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29015#problem/Ahttp://acm.hdu.edu.cn/showproblem.php?pid=2544最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Jav原创 2013-08-17 22:55:20 · 682 阅读 · 0 评论 -
畅通工程续(hdu1874,floyd最短路)
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29015#problem/Ehttp://acm.hdu.edu.cn/showproblem.php?pid=1874畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (J原创 2013-08-17 22:56:25 · 726 阅读 · 0 评论 -
XYZZY(hdu1317,传递闭包+Dijstra)
http://acm.hdu.edu.cn/showproblem.php?pid=1317http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29015#problem/FF - XYZZYTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d &原创 2013-08-17 23:06:04 · 898 阅读 · 0 评论 -
COURSES(poj1469,二分图最大匹配)
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29327#problem/Ahttp://poj.org/problem?id=1469A - COURSESTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit原创 2013-08-19 08:56:14 · 653 阅读 · 0 评论 -
奔小康赚大钱(hdu2255,二分图最大权匹配)
http://acm.hdu.edu.cn/showproblem.php?pid=2255http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29327#problem/DD - 奔小康赚大钱Description传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革:重新分配房子。这可是一件大事,关系到人民原创 2013-08-19 09:01:38 · 751 阅读 · 0 评论 -
昂贵的聘礼(poj1052,枚举+Dijstra)
/*http://poj.org/problem?id=1062昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 32242 Accepted: 9157Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应原创 2013-08-17 22:53:55 · 1074 阅读 · 0 评论 -
Tram(poj1847,floyd)
http://poj.org/problem?id=1847http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29015#problem/HH - TramTime Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uSubmit原创 2013-08-17 23:02:07 · 651 阅读 · 0 评论 -
最短路径问题(hdu3790,Dijstra)
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29015#problem/Bhttp://acm.hdu.edu.cn/showproblem.php?pid=3790最短路径问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K原创 2013-08-17 22:59:29 · 895 阅读 · 0 评论 -
A Walk Through the Forest(hdu1142,最短路+dfs)
http://acm.hdu.edu.cn/showproblem.php?pid=1142A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4623 Accepted原创 2013-08-17 11:46:50 · 591 阅读 · 0 评论 -
To the Max(poj1050,最大连续和)
/*http://poj.org/problem?id=1050To the MaxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 36957 Accepted: 19470DescriptionGiven a two-dimensional array of positive and negative i原创 2013-08-16 21:09:46 · 665 阅读 · 0 评论 -
Magic Pen 6(hdu4648,贪心)
http://acm.hdu.edu.cn/showproblem.php?pid=4648Magic Pen 6Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1099 Accepted Submission(s):原创 2013-08-16 21:18:10 · 717 阅读 · 0 评论 -
Fliping game(hdu4642)
/*http://acm.hdu.edu.cn/showproblem.php?pid=4642Fliping gameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 191 Accepted Submission原创 2013-08-16 21:20:22 · 739 阅读 · 0 评论 -
B - Brave Game(hdu1846,巴什博弈基础)
http://acm.hdu.edu.cn/showproblem.php?pid=1846http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29256#problem/BB - Brave GameTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:原创 2013-08-17 11:41:14 · 643 阅读 · 0 评论