求刪點后最小的生成樹，n<50.。。。數(shù)據(jù)好弱，直接暴力枚舉就行。。。刪點的時候直接g[i][j]=INF就行了。

?

#include<iostream> #include<algorithm> #include<fstream> #include<string> #include<vector> #include<stack> #include<queue> #include<cstdio> #include<cstring> #include<cstdlib> #include<cmath> #include<map> #include<set> #define FF(i, a, b) for(i=a; i<b; i++) #define FD(i, a, b) for(i=a; i>b; i--) #define CLR(a, b) memset(a, b, sizeof(a)) #define LL long long #define CPY(a, b) memcpy(a, b, sizeof(b)) using namespace std; ofstream fout ("output.txt"); ifstream fin ("input.txt");const int maxn = 100; const double INF = 222222; int T, n; double g[maxn][maxn], low[maxn], x[maxn], y[maxn], tmp[maxn][maxn]; bool vis[maxn];double prim(int start) {double min, res=0;int i, j, pos;CLR(vis, 0);vis[start] = 1; pos = start;FF(i, 1, n+1) if(i!=pos) low[i] = g[pos][i];FF(i, 1, n){min = INF;FF(j, 1, n+1)if(vis[j] == 0 && min > low[j])min = low[j], pos = j;res += min;vis[pos] = 1;FF(j, 1, n+1)if(vis[j] == 0 && low[j] > g[pos][j])low[j] = g[pos][j];}return res; }int main() {scanf("%d", &T);while(T--){int i, j;scanf("%d", &n);FF(i, 1, n+1) scanf("%lf%lf", &x[i], &y[i]);FF(i, 1, n+1)FF(j, 1, n+1)g[i][j] = sqrt((x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]));double ans = INF*INF;FF(i, 1, n+1){CPY(tmp, g);FF(j, 1, n+1){g[i][j] = g[j][i] = INF;}ans = min(ans, prim(1));CPY(g, tmp);}printf("%.2lf\n", n < 3 ? 0 : ans-INF);}return 0; }

?

?

轉(zhuǎn)載于:https://www.cnblogs.com/dyllove98/p/3188640.html

總結(jié)

以上是生活随笔為你收集整理的hdu 3405 world islands的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。