2013年7月31日

HDU 2255 奔小康赚大钱 (KM算法 模板题)

摘要:奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2129Accepted Submission(s): 923Problem Description传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革:重新分配房子。这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住(如果有老百姓没房子住的话,容易引起不安定因素),每家必须分配到一间房子且只能得到一间房子。另一方面,村长和另 阅读全文

posted @ 2013-07-31 21:11 kuangbin 阅读 (1663) 评论 (0) 编辑

【转】一些图论、网络流入门题总结、汇总

摘要:最短路问题此类问题类型不多,变形较少POJ 2449 Remmarguts' Date(中等)http://acm.pku.edu.cn/JudgeOnline/problem?id=2449题意:经典问题:K短路解法:dijkstra+A*(rec),方法很多相关:http://acm.pku.edu.cn/JudgeOnline/showcontest?contest_id=1144该题亦放在搜索推荐题中POJ 3013 - Big Christmas Tree(基础)http://acm.pku.edu.cn/JudgeOnline/problem?id=3013题意:最简单最短 阅读全文

posted @ 2013-07-31 17:59 kuangbin 阅读 (13056) 评论 (3) 编辑

HDU 2859 Phalanx (DP)

摘要:PhalanxTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 363Accepted Submission(s): 170Problem DescriptionToday is army day, but the servicemen are busy with the phalanx for the celebration of the 60th anniversary of the PRC.A phalanx is a matrix of 阅读全文

posted @ 2013-07-31 17:02 kuangbin 阅读 (1559) 评论 (0) 编辑

HDU 2888 Check Corners(二维RMQ)

摘要:Check CornersTime Limit: 2000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1362Accepted Submission(s): 503Problem DescriptionPaul draw a big m*n matrix A last month, whose entries Ai,j are all integer numbers ( 1 #include #include #include using namespace std;i 阅读全文

posted @ 2013-07-31 14:25 kuangbin 阅读 (472) 评论 (0) 编辑

POJ 2019 Cornfields (二维RMQ)

摘要:CornfieldsTime Limit:1000MSMemory Limit:30000KTotal Submissions:4911Accepted:2392DescriptionFJ has decided to grow his own corn hybrid in order to help the cows make the best possible milk. To that end, he's looking to build the cornfield on the flattest piece of land he can find.FJ has, at grea 阅读全文

posted @ 2013-07-31 11:41 kuangbin 阅读 (1847) 评论 (0) 编辑

POJ 3368 Frequent values (RMQ)

摘要:Frequent valuesTime Limit:2000MSMemory Limit:65536KTotal Submissions:11540Accepted:4206DescriptionYou are given a sequence ofnintegersa1, a2, ... , anin non-decreasing order. In addition to that, you are given several queries consisting of indicesiandj(1 ≤ i ≤ j ≤ n). For each query, determine the m 阅读全文

posted @ 2013-07-31 00:38 kuangbin 阅读 (368) 评论 (0) 编辑

导航

统计

JAVASCRIPT: