07 2014 档案

普利姆算法（最小生成树）
摘要：int prim(){ int minid, i, j; double mincost; for(i = 2; i 0){ mincost = lowcost[j]; minid = j; } ... 阅读全文
posted @ 2014-07-19 16:49 小叶叶 阅读(273) 评论(0) 推荐(0)
杭电1142（最短路径+dfs）
摘要：A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5421Accepted Submission(s... 阅读全文
posted @ 2014-07-17 16:45 小叶叶 阅读(263) 评论(0) 推荐(0)
杭电2955（01背包）
摘要：RobberiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11119Accepted Submission(s): 4121Problem ... 阅读全文
posted @ 2014-07-15 12:04 小叶叶 阅读(297) 评论(0) 推荐(0)
杭电2059（dp）
摘要：龟兔赛跑Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10936Accepted Submission(s): 4099Problem Descr... 阅读全文
posted @ 2014-07-14 23:08 小叶叶 阅读(310) 评论(0) 推荐(0)
杭电1158
摘要：Employment PlanningTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3515Accepted Submission(s): 14... 阅读全文
posted @ 2014-07-14 16:51 小叶叶 阅读(196) 评论(0) 推荐(0)