随笔分类 -  图

floyd算法 poj1125
摘要：Stockbroker GrapevineTime Limit:1000MSMemory Limit:10000KTotal Submissions:28851Accepted:16003DescriptionStockbrokers ar... 阅读全文
posted @ 2015-06-02 18:15 cyd2014 阅读(146) 评论(0) 推荐(0)
poj3259 Bellman_Ford算法
摘要：WormholesTime Limit:2000MSMemory Limit:65536KTotal Submissions:34465Accepted:12585DescriptionWhile exploring his many farms, Farmer John has discovere... 阅读全文
posted @ 2015-06-01 21:51 cyd2014 阅读(191) 评论(0) 推荐(0)
poj1860 Bellman_Ford算法
摘要：Currency ExchangeTime Limit:1000MSMemory Limit:30000KTotal Submissions:21922Accepted:7910DescriptionSeveral currency exchange points are working in ou... 阅读全文
posted @ 2015-05-29 21:35 cyd2014 阅读(147) 评论(0) 推荐(0)
bellman－ford算法
摘要：给定图G(V, E)（其中V、E分别为图G的顶点集与边集），源点s，数组Distant[i]记录从源点s到顶点i的路径长度，初始化数组Distant[n]为, Distant[s]为0；以下操作循环执行至多n-1次，n为顶点数：对于每一条边e(u, v)，如果Distant[u] + w(u, v)... 阅读全文
posted @ 2015-05-29 20:09 cyd2014 阅读(275) 评论(0) 推荐(0)
昂贵的聘礼 Dijkstra法
摘要：poj 1062Time Limit:1000MSMemory Limit:10000KTotal Submissions:39437Accepted:11432Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘... 阅读全文
posted @ 2015-05-03 16:37 cyd2014 阅读(215) 评论(0) 推荐(0)
Til the Cows Come Home(poj 2387 Dijkstra算法（单源最短路径）)
摘要：Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 32824 Accepted: 11098 Description Bessie is out in the field and wants to get back to the b 阅读全文
posted @ 2015-05-01 15:19 cyd2014 阅读(1371) 评论(0) 推荐(0)