ZefengYao - 博客园

FZOJ 2102 Solve equation

摘要： Problem 2102 Solve equation Accept: 1097 Submit: 2608Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description Accept: 1097 Submit: 2608Time L 阅读全文

posted @ 2017-04-23 23:54 ZefengYao 阅读(239) 评论(0) 推荐(0) 编辑

hdu 2089 不要62

摘要：不要62 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 41353 Accepted Submission(s): 15070 Problem 阅读全文

posted @ 2017-04-18 22:54 ZefengYao 阅读(163) 评论(0) 推荐(0) 编辑

hdu 2717 Catch That Cow

摘要：恢复内容开始 Catch That Cow Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14433 Accepted Submission(s 阅读全文

posted @ 2017-04-18 22:50 ZefengYao 阅读(202) 评论(0) 推荐(0) 编辑

poj 3368 Frequent values

摘要： Frequent values Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 18520 Accepted: 6687 Description You are given a sequence of n integers a1 阅读全文

posted @ 2017-04-12 13:27 ZefengYao 阅读(156) 评论(0) 推荐(0) 编辑

poj 3264 Balanced Lineup

摘要： Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 51876 Accepted: 24319 Case Time Limit: 2000MS Description For the daily mil 阅读全文

posted @ 2017-04-10 21:08 ZefengYao 阅读(117) 评论(0) 推荐(0) 编辑

best corder MG loves gold

摘要： MG loves gold Accepts: 451 Submissions: 1382 Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) MG loves gold Accepts: 阅读全文

posted @ 2017-04-10 19:31 ZefengYao 阅读(447) 评论(0) 推荐(0) 编辑

poj 1081 To The Max

摘要： To The Max Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12697 Accepted Submission(s): 6090 Pro 阅读全文

posted @ 2017-04-09 23:04 ZefengYao 阅读(254) 评论(0) 推荐(0) 编辑

hdu 5045 Contest

摘要： Contest Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1777 Accepted Submission(s): 719 Problem 阅读全文

posted @ 2017-04-09 22:40 ZefengYao 阅读(172) 评论(0) 推荐(0) 编辑

hdu 4068 SanguoSHA

摘要： SanguoSHA Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1246 Accepted Submission(s): 685 Proble 阅读全文

posted @ 2017-04-09 21:16 ZefengYao 阅读(236) 评论(0) 推荐(0) 编辑

TSP 旅行商问题(状态压缩dp)

摘要：题意：有n个城市，有p条单向路径，连通n个城市，旅行商从0城市开始旅行，那么旅行完所有城市再次回到城市0至少需要旅行多长的路程。思路：n较小的情况下可以使用状态压缩dp，设集合S代表还未经过的城市的集合，那么dp[S][v]:当前旅行商还有集合S中的城市没有旅行，并且在城市v时走过的所有路径长度阅读全文

posted @ 2017-04-08 21:17 ZefengYao 阅读(370) 评论(0) 推荐(0) 编辑