MST
Pekary
Read the tea leaves.
展开
-
POJ 1639 最小度限制生成树
#include#include#include#include#include#define max(f, s) (f) > (s)? (f):(s)using namespace std;const int N = 32;const int INF = 0x3f3f3f3f;map mS2I;int num, k;int g[N][N], dis[N], max_原创 2015-08-10 14:33:05 · 389 阅读 · 0 评论 -
POJ1679 The Unique MST 次小生成树
#include#include#include#includeusing namespace std;const int N = 128;int g[N][N], vis[N], dis[N], pre[N], used[N][N], mmax[N][N];int n, m;struct Node{ int u, len; Node(){}; N原创 2015-08-11 16:55:48 · 310 阅读 · 0 评论