http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1203 大意: 给出一些点,求MST 把这几天的MST一口气发上来. kruskal #include<cstdio> #include<cmath> #include<algorithm> using namespace std; const int MAXN=101; const int INF=9999999; int fa[MAXN]; s…
主题链接:problemId=203" target="_blank">ZOJ 1203 Swordfish 旗鱼 Swordfish Time Limit: 2 Seconds Memory Limit: 65536 KB There exists a world within our world A world beneath what we call cyberspace. A world protected by firewalls, password…
题目: There exists a world within our world A world beneath what we call cyberspace. A world protected by firewalls, passwords and the most advanced security systems. In this world we hide our deepest secrets, our most incriminating information, and of…
题目: There exists a world within our world A world beneath what we call cyberspace. A world protected by firewalls, passwords and the most advanced security systems. In this world we hide our deepest secrets, our most incriminating information, and of…
#include "stdio.h". #include <iostream> #include<math.h> using namespace std; double dis[105][105]; double p[105][2];//点的坐标 double ans;//最短距离 int n; void makedis()//算出两个点之间的距离 { int i, j; double r; for (i = 0; i < n; i++) for (j =…
