uva10397 Connect the Campus
题意:
最小生成树,有的边已经不用考虑:
代码:
#include
#include
#include
#define N 760
double w[N][N],x[N],y[N],key[N];
int pre[N], hash[N], n, m;
inline double getDist(double x1,double y1,double x2,double
原创
2016-03-11 14:32:06 ·
265 阅读 ·
0 评论