Rookie的博客

Description So 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

Description 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 a

UVa 10048 这道题只需要在Floyd算法稍微改一下就行了，求出间接能到达一点的最大值，和 本身求出最小值就行了。 #include #define INF 100000005 const int maxn = 105; int map[maxn][maxn], n, m; void init ( ) { for ( int i = 0; i <= n; i ++ )

Description Leo 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

描述 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