Eddy’s picture hdu1162

http://acm.hdu.edu.cn/showproblem.php?pid=1162

#include//2235778 2010-03-23 18:04:30 Accepted 1162 0MS 352K 1248 B C++ 悔惜晟
#include//最小產生樹的問題 Kruskal
#include//
#include
int aa[4951];
using namespace std;

struct stu
{
double x;
double y;
} df[101];

struct stu1
{
double distance;
int n;
int m;
}df1[4951];

int cmp(stu1 a, stu1 b)
{
return a.distance b)
aa[b] = a;
else
aa[a] = b;
}
int main()
{
int n, i, j, num;
double sum;
while(scanf("%d", &n) !=EOF )
{
for(i = 0; i

上一篇：暢通工程再續 hdu1875

下一篇：Jungle Roads hdu1301