随笔- 107  文章- 0  评论- 6  阅读- 96196 
09 2016 档案
hdu-1179-二分图最大匹配
摘要:Ollivanders: Makers of Fine Wands since 382 BC. Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 阅读全文
posted @ 2016-09-27 19:53 几缕清风依旧 阅读(251) 评论(0) 推荐(0) 编辑
hdu-2063-二分图最大匹配
摘要:过山车 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19208 Accepted Submission(s): 8393 Problem De 阅读全文
posted @ 2016-09-27 19:48 几缕清风依旧 阅读(188) 评论(0) 推荐(0) 编辑
(转)二分图的最大匹配、完美匹配和匈牙利算法
摘要:二分图的最大匹配、完美匹配和匈牙利算法 这篇文章讲无权二分图(unweighted bipartite graph)的最大匹配(maximum matching)和完美匹配(perfect matching),以及用于求解匹配的匈牙利算法(Hungarian Algorithm);不讲带权二分图的最 阅读全文
posted @ 2016-09-25 16:33 几缕清风依旧 阅读(286) 评论(0) 推荐(0) 编辑
hdu-2444-二分图判定+最大分配
摘要:The Accomodation of Students Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5451 Accepted Submis 阅读全文
posted @ 2016-09-25 16:19 几缕清风依旧 阅读(398) 评论(0) 推荐(0) 编辑
C - NP-Hard Problem(二分图判定-染色法)
摘要:C - NP-Hard Problem Crawling in process... Crawling failed Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practic 阅读全文
posted @ 2016-09-23 19:41 几缕清风依旧 阅读(1126) 评论(0) 推荐(0) 编辑
E - The Values You Can Make
摘要:E - The Values You Can Make Description Pari wants to buy an expensive chocolate from Arya. She has n coins, the value of the i-th coin is ci. The pri 阅读全文
posted @ 2016-09-21 20:04 几缕清风依旧 阅读(566) 评论(0) 推荐(0) 编辑
C - NP-Hard Problem
摘要:C - NP-Hard Problem Crawling in process... Crawling failed Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u C - NP-Hard Problem D 阅读全文
posted @ 2016-09-21 18:49 几缕清风依旧 阅读(430) 评论(0) 推荐(0) 编辑
【转】acm小技巧
摘要:1、一般用c语言节约空间,要用c++库函数或STL时才用c++; cout、cin和printf、scanf最好不要混用。 大数据输入输出最后不用cin、cout,纺织超市。 2、有时候int型不够用,可以用long long或__int64型(俩个下划线__)。 值类型表示值介于-2^64(-92 阅读全文
posted @ 2016-09-18 18:21 几缕清风依旧 阅读(345) 评论(0) 推荐(1) 编辑
poj-1703-Find them, Catch them
摘要:Find them, Catch them Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 41928 Accepted: 12886 Description The police office in Tadu City deci 阅读全文
posted @ 2016-09-18 14:46 几缕清风依旧 阅读(429) 评论(0) 推荐(0) 编辑
poj-1611-The Suspects
摘要:The Suspects Time Limit: 1000MS Memory Limit: 20000K Total Submissions: 34284 Accepted: 16642 Description Severe acute respiratory syndrome (SARS), an 阅读全文
posted @ 2016-09-18 13:23 几缕清风依旧 阅读(255) 评论(0) 推荐(0) 编辑
poj-2236-Wireless Network
摘要:Wireless Network Description An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with t 阅读全文
posted @ 2016-09-18 12:49 几缕清风依旧 阅读(598) 评论(0) 推荐(0) 编辑
hdu-4496-D-City
摘要:D-City Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3838 Accepted Submission(s): 1379 Problem 阅读全文
posted @ 2016-09-18 11:39 几缕清风依旧 阅读(164) 评论(0) 推荐(0) 编辑
hdu-1213-How Many Tables
摘要:How Many Tables Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25116 Accepted Submission(s): 125 阅读全文
posted @ 2016-09-18 11:33 几缕清风依旧 阅读(295) 评论(0) 推荐(0) 编辑
hdu-1856-More is better
摘要:More is better Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 24825 Accepted Submission(s): 89 阅读全文
posted @ 2016-09-18 11:30 几缕清风依旧 阅读(362) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示