spfa
oopslb
这个作者很懒,什么都没留下…
展开
-
hdu 2680 Choose the best route (SPFA)
Choose the best route Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15495 Accepted Submission(s): 5028 Problem DescriptionOne...原创 2017-09-22 21:41:17 · 193 阅读 · 0 评论 -
poj 2449 Remmarguts' Date(第K短路)
Remmarguts' DateTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 33704 Accepted: 9145Description"Good man never makes girls wait or breaks an appointment原创 2018-05-02 23:10:52 · 138 阅读 · 0 评论 -
poj3114Countries in War
Countries in WarTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4383 Accepted: 1278DescriptionIn the year 2050, after different attempts of the UN t原创 2018-01-31 17:06:58 · 207 阅读 · 0 评论 -
poj3160Father Christmas flymouse
Father Christmas flymouseTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 3770 Accepted: 1247DescriptionAfter retirement as contestant from WHU ACM原创 2018-01-31 16:13:26 · 203 阅读 · 0 评论 -
hdu 6331 Walking Plan (至少经过k条路的最短路)
http://acm.hdu.edu.cn/showproblem.php?pid=6331题意:至少经过k条路的最短路思路:因为k最大是10000的如果直接,用矩阵跑floyd k次的话铁定TLE,然后我们可以用a数组来记录两个点经过100以内的边的最短路,b数组来记录整百的路径数的最短路,这样就极大优化了时间和空间,a数组就用图中所给的路径来跑矩阵floyd100次,b数组就用a[10...原创 2018-08-07 10:03:57 · 616 阅读 · 1 评论