UVA 821 Page Hopping （Floyd）

题意：

告诉你哪两个点连通，求平均距离，为每个结点到其他点距离总和除以总对数。

思路：

Floyd水题

这个题点不是连续的，直接存到vector里 枚举vector好了。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#define Siz(x) (int)x.size()
using namespace std;

int g[107][107];
bool vis[107];
vector<int>node;
int main(){
    int u,v;
    int n = 1,ks = 0;
    while(~scanf("%d %d",&u, &v) && (u || v)){
        memset(vis,0,sizeof vis);
        node.clear();
        vis[v] = vis[u] = 1;
        node.push_back(u); node.push_back(v);
        for (int i = 1; i <= 100; ++i){
            for (int j = 1; j <= 100; ++j) {
                g[i][j] = 1000;
            }
        }
        g[u][v] = 1;
        while(~scanf("%d %d",&u, &v) && (u || v)){
            g[u][v] = 1;
            if (!vis[u]){
                node.push_back(u);
                vis[u] = 1;
            }
            if (!vis[v]){
                node.push_back(v);
                vis[v] = 1;
            }
        }
        for (int k = 0; k < Siz(node); ++k){
            for (int i = 0; i < Siz(node); ++i){
                for (int j = 0; j < Siz(node); ++j){
                    int ii = node[i]; int jj = node[j]; int kk = node[k];
                    g[ii][jj] = min(g[ii][kk]+g[kk][jj],g[ii][jj]);
                }
            }
        }
        int sum = 0;
        for (int i = 0; i < Siz(node); ++i){
            for (int j = 0; j < Siz(node); ++j){
                if (i != j){
                    sum += g[node[i] ][node[j] ];
                }
            }

        }
        printf("Case %d: average length between pages = %.3f clicks\n",++ks, sum*1.0/(Siz(node)*(Siz(node)-1)));
    }
    return 0;
}