10 2013 档案

hdu 4284 Travel(压缩DP，4级)
摘要：TravelTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2641Accepted Submission(s): 724Problem Desc... 阅读全文
posted @ 2013-10-30 09:34 剑不飞 阅读(154) 评论(0) 推荐(0)
hdu 4587 TWO NODES (枚举+割点，5级)
摘要：TWO NODESTime Limit: 24000/12000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 547 Accepted Submission(s): 179Probl... 阅读全文
posted @ 2013-10-29 22:02 剑不飞 阅读(160) 评论(0) 推荐(0)
2013 年亚洲赛杭州赛区卡题总结
摘要：今天这场比赛，真的打的很痛苦，从头卡到尾，实在是无语，哭死，这是一次严重的战略失误！！！ 好吧！就先描述一下所有的比赛过程吧！ 赛前安排，中场12：30无论如何必须把所有题看一遍，然后挑几题啃。再Acdreamer和cyendra去找水题先A了，我把帐号信息，编译器，print什么之类的搞定。 之... 阅读全文
posted @ 2013-10-27 21:10 剑不飞 阅读(176) 评论(0) 推荐(0)
SPFA 判环优化
摘要：如果总的入队次数大于所以点两倍时有负环，或单个点的入队次数大于sqrt(点数)有负环。 阅读全文
posted @ 2013-10-26 21:53 剑不飞 阅读(148) 评论(0) 推荐(0)
全局最小割
摘要：一个无向连通网络，去掉一个边集可以使其变成两个连通分量则这个边集就是割集；最小割集当然就权和最小的割集。可以用最小切割最大流定理：1.min=MAXINT,确定一个源点2.枚举汇点3.计算最大流，并确定当前源汇的最小割集，若比min小更新min4.转到2直到枚举完毕5.min即为所求输出min 不难... 阅读全文
posted @ 2013-10-18 20:58 剑不飞 阅读(896) 评论(0) 推荐(0)
UVA 10600 ACM Contest and Blackout（次小树，3级）
摘要：F -ACM Contest and BlackoutTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusAppoint description:DescriptionProblem AACM CONTEST... 阅读全文
posted @ 2013-10-16 15:21 剑不飞 阅读(227) 评论(0) 推荐(0)
UVA 11865 Stream My Contest（最小树形图，4级）
摘要：C -Stream My ContestTime Limit:1000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusAppoint description:DescriptionGStream My ContestInput:Sta... 阅读全文
posted @ 2013-10-16 15:19 剑不飞 阅读(268) 评论(0) 推荐(0)
HDU 4081 Qin Shi Huang's National Road System（次小树，4级）
摘要：A -Qin Shi Huang's National Road SystemTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionDu... 阅读全文
posted @ 2013-10-16 15:15 剑不飞 阅读(267) 评论(0) 推荐(0)
UVALive 3887 Slim Span（枚举+MST，4级）
摘要：E -Slim SpanTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusAppoint description:DescriptionGiven an undirected weighted graphG... 阅读全文
posted @ 2013-10-16 13:44 剑不飞 阅读(150) 评论(0) 推荐(0)
codeforce 365 C. Compartments(gready,4级)
摘要：C. Compartmentstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA team of students from the city S... 阅读全文
posted @ 2013-10-16 13:34 剑不飞 阅读(286) 评论(0) 推荐(0)
codeforce 356 A. Knight Tournament(线段树覆盖，3级)
摘要：A. Knight Tournamenttime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputHooray! Berl II, the king of... 阅读全文
posted @ 2013-10-16 13:30 剑不飞 阅读(131) 评论(0) 推荐(0)
UVA 11354 Bond(prim+LCA,4级)
摘要：B -BondTime Limit:8000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusAppoint description:DescriptionBNEXT Generation Contest 4Time Limit – 8... 阅读全文
posted @ 2013-10-15 11:58 剑不飞 阅读(222) 评论(0) 推荐(0)
做题引发的内存思考问题-poj 2942
摘要：POJ 2942-Knights of the Round TableTime Limit:7000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionBeing ... 阅读全文
posted @ 2013-10-14 11:31 剑不飞 阅读(195) 评论(0) 推荐(0)
POJ 3694 Network（双连通+LCA，5级）
摘要：NetworkTime Limit:5000MSMemory Limit:65536KTotal Submissions:6013Accepted:2091DescriptionA network administrator manages a large network. The network ... 阅读全文
posted @ 2013-10-13 19:05 剑不飞 阅读(153) 评论(0) 推荐(0)
POJ 3177 Redundant Paths(边双连通分量，3级)
摘要：A -Redundant PathsTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionIn order to get from on... 阅读全文
posted @ 2013-10-12 20:55 剑不飞 阅读(136) 评论(0) 推荐(0)
POJ 1719 Shooting Contest（KM，4级）
摘要：I -Shooting ContestTime Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionWelcome to the Annual ... 阅读全文
posted @ 2013-10-12 14:10 剑不飞 阅读(212) 评论(0) 推荐(0)
HDU 3605 Escape(多重KM，4级)
摘要：F -EscapeTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:Description2012 If this is the end of the w... 阅读全文
posted @ 2013-10-12 12:47 剑不飞 阅读(158) 评论(0) 推荐(0)
HDU 2389 Rain on your Parade(HK||KM,4级)
摘要：E -Rain on your ParadeTime Limit:3000MSMemory Limit:165535KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionYou’re giving a pa... 阅读全文
posted @ 2013-10-12 12:44 剑不飞 阅读(148) 评论(0) 推荐(0)
HDU 3829 Cat VS Dog（二分图，4级）
摘要：C -Cat VS DogTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionThe zoo have N cats and M do... 阅读全文
posted @ 2013-10-11 21:31 剑不飞 阅读(199) 评论(0) 推荐(0)
HDU 3468 Treasure Hunting（最短路+二分图，4级）
摘要：D -Treasure HuntingTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionDo you like treasure h... 阅读全文
posted @ 2013-10-11 21:28 剑不飞 阅读(410) 评论(0) 推荐(0)
HDU 3360 National Treasures(KM,4级)
摘要：A -National TreasuresTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionThe great hall of th... 阅读全文
posted @ 2013-10-10 21:26 剑不飞 阅读(163) 评论(0) 推荐(0)
亚洲赛前训练计划
摘要：回顾和加深所学算法。主要回顾用途及使用方法。图论方面： 1.dfs,bfs 2.强连通，点双连通，边双连通，2-sat 3.匈牙利算法km,以及不等式解 4.网络流，费用流 5.最短路，SPFA，dijstra, floay,斯坦纳树，最短路的DP类型判圈，环等 6.LCA。 7.... 阅读全文
posted @ 2013-10-09 14:38 剑不飞 阅读(138) 评论(0) 推荐(0)
hdu 1055 Color a Tree(树上贪心，4级)
摘要：Color a TreeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 854Accepted Submission(s): 281Problem ... 阅读全文
posted @ 2013-10-07 18:25 剑不飞 阅读(317) 评论(0) 推荐(0)
hdu 4435 charge-station(最短路+思维，5级)
摘要：E -charge-stationTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4435Appoint description:DescriptionThere ar... 阅读全文
posted @ 2013-10-07 15:28 剑不飞 阅读(211) 评论(0) 推荐(0)
hdu 4433 locker(DP,4级)
摘要：C -lockerTime Limit:3000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionA password locker with N digits,... 阅读全文
posted @ 2013-10-07 11:39 剑不飞 阅读(199) 评论(0) 推荐(0)
poj 3208 Apocalypse Someday(数位DP，4级)
摘要：Apocalypse SomedayTime Limit:1000MSMemory Limit:131072KTotal Submissions:1385Accepted:632DescriptionThe number 666 is considered to be the occult “num... 阅读全文
posted @ 2013-10-06 15:32 剑不飞 阅读(255) 评论(0) 推荐(0)
hdu 4424 Conquer a New Region(并查集，4级)
摘要：E -Conquer a New RegionTime Limit:4000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4424DescriptionThe wheel of the histo... 阅读全文
posted @ 2013-10-05 17:07 剑不飞 阅读(201) 评论(0) 推荐(0)
hdu 4427 Math Magic(DP,4级)
摘要：H -Math MagicTime Limit:2000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4427DescriptionYesterday, my teacher taught us ... 阅读全文
posted @ 2013-10-05 15:30 剑不飞 阅读(159) 评论(0) 推荐(0)
hdu 4421 Bit Magic(2-sat,4级)
摘要：B -Bit MagicTime Limit:2000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4421DescriptionYesterday, my teacher taught me a... 阅读全文
posted @ 2013-10-05 14:09 剑不飞 阅读(184) 评论(0) 推荐(0)
hdu 4468 spy(KMP应用，5级）
摘要：SpyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 285Accepted Submission(s): 136Problem Descripti... 阅读全文
posted @ 2013-10-04 20:51 剑不飞 阅读(173) 评论(0) 推荐(0)
hdu 4454 Stealing a Cake(三分，4级)
摘要：Stealing a CakeTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1013Accepted Submission(s): 288Prob... 阅读全文
posted @ 2013-10-04 14:48 剑不飞 阅读(204) 评论(0) 推荐(0)
HDU 4473 HDOJ Exam (推理，5级)
摘要：ExamTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 590Accepted Submission(s): 250Problem Descri... 阅读全文
posted @ 2013-10-03 19:18 剑不飞 阅读(209) 评论(0) 推荐(0)
hdu 4474 Yet Another Multiple Problem(按位枚举，4级)
摘要：Yet Another Multiple ProblemTime Limit: 40000/20000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1754Accepted Submiss... 阅读全文
posted @ 2013-10-03 15:47 剑不飞 阅读(143) 评论(0) 推荐(0)
hdu 4465 Candy(概率公式+极大乘极小，4级)
摘要：CandyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1016Accepted Submission(s): 449Special JudgeP... 阅读全文
posted @ 2013-10-03 14:28 剑不飞 阅读(247) 评论(0) 推荐(0)
HDU 3035 War (dijstra+最小割建图,4级)
摘要：G -WarTime Limit:10000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionCountry X is under attack by enemi... 阅读全文
posted @ 2013-10-02 16:52 剑不飞 阅读(233) 评论(0) 推荐(0)