AC_Von

摘要： 貌似是道水题。Prim， 484MS水过。。。#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int N = 505;const int inf = 0x7ffffff;int dis[N][N];int low[N];int vis[N];int v[N];void Prim(int n){ int flag, i, j, min, sum = 0; for(i = 1; i <= n; i++) { low[i] = dis[1][i]; 阅读全文