2013 年 9月 6 日随笔档案 - 海拉鲁的林克

2013年9月6日

摘要：题目：The Shortest PathTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1827Accepted Submission(s): 589Problem DescriptionThere are N cities in the country. Each city is represent by a matrix size of M*M. If city A, B and C satisfy that A*B = C, we say 阅读全文

posted @ 2013-09-06 19:03 海拉鲁的林克阅读(227) 评论(0) 推荐(0) 编辑

HDU - 2923 - Einbahnstrasse

摘要：题目：EinbahnstrasseTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1548Accepted Submission(s): 428Problem DescriptionEinbahnstra e (German for a one-way street) is a street on which vehicles should only move in one direction. One reason for having .. 阅读全文

posted @ 2013-09-06 16:19 海拉鲁的林克阅读(261) 评论(0) 推荐(0) 编辑

转载 - 最短路&差分约束题集

摘要：出处：http://blog.csdn.net/shahdza/article/details/7779273最短路【HDU】1548 A strange lift基础最短路(或bfs)★2544 最短路基础最短路★3790 最短路径问题基础最短路★2066 一个人的旅行基础最短路(多源多汇,可以建立超级源点和终点)★2112 HDU Today基础最短路★1874 畅通工程续基础最短路★1217 Arbitrage 货币交换 Floyd (或者 Bellman-Ford 判环)★1245 Saving James Bond计算几何+最短路★1317 XYZZY Bellma... 阅读全文

posted @ 2013-09-06 12:51 海拉鲁的林克阅读(279) 评论(0) 推荐(0) 编辑