模板题,没啥好说的。。
最小树形图的解法见:http://www.cnblogs.com/vongang/archive/2012/07/18/2596851.html
CODE:
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MAX 50010
#define INF (min_dis[0])
using namespace std;
struct Point{
int x,y;
}point[MAX];
int points,edges;
int head[MAX],total;
int next[MAX],aim[MAX],from[MAX];
double length[MAX];
double min_dis[MAX];
int father[MAX];
int vis[MAX],nu......
阅读全文