最短路径
RookieZQF
尽自己最大努力才能不后悔
展开
-
FatMouse and JavaBean II
DescriptionSo this is the second version of FatMouse and his favorite food, JavaBean -- boy he just cannot have enough of it, can he? Again FatMouse was lucky enough to find a map of another storeho翻译 2015-11-16 10:43:11 · 359 阅读 · 0 评论 -
Fire Station
DescriptionA city is served by a number of fire stations. Some residents have complained that the distance from their houses to the nearest station is too far, so a new station is to be built. You a翻译 2015-11-17 21:10:56 · 353 阅读 · 0 评论 -
Audiophobia
UVa 10048这道题只需要在Floyd算法稍微改一下就行了,求出间接能到达一点的最大值,和本身求出最小值就行了。#include #define INF 100000005const int maxn = 105;int map[maxn][maxn], n, m;void init ( ){ for ( int i = 0; i <= n; i ++ )翻译 2015-11-18 12:52:14 · 811 阅读 · 0 评论 -
ZOJ Paint the Grid Reloaded
DescriptionLeo has a grid with N rows and M columns. All cells are painted with either black or white initially.Two cells A and B are called connected if they share an edge and they are in the s翻译 2016-02-29 18:57:09 · 341 阅读 · 0 评论 -
Fire Station
描述A city is served by a number of fire stations. Some residents have complained that the distance from their houses to the nearest station is too far, so a new station is to be built. You are to c原创 2016-06-06 12:14:27 · 705 阅读 · 0 评论