题意:给出一些点的坐标,计算并输出将这些坐标连成一条线的最短长度,和各段的长度。
题解:将n个点全排列然后计算并保存各点之间的距离,找到最小距离,输出各段对应线路的长度和总长度。
#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 10;
const int INF = 0x3f3f3f3f;
struct P {
int x, y;
}p[N];
double l[N], l1[N];
P p1[N], ans[N];
double count(int *s, int i) {
int a = s[i];
int b = s[i + 1];
l[i] = sqrt(pow((p[a].x - p[b].x), 2) + pow((p[a].y - p[b].y), 2));
p1[i].x = a;
p1[i].y = b;
return l[i];
}
int main() {
int t = 1, n;
double len, min;
while (scanf("%d", &n) && n) {
int s[N];
min = INF;
cout << "**********************************************************\n";
cout << "Network #" << t++ << endl;
for (int i = 0; i < n; i++) {
scanf("%d%d", &p[i].x, &p[i].y);
s[i] = i;
}
do {
len = 0;
for (int i = 0; i < n - 1; i++)
len += count(s, i);
if (len < min) {
for (int i = 0; i < n - 1; i++) {
ans[i].x = p1[i].x;
ans[i].y = p1[i].y;
l1[i] = l[i];
}
min = len;
}
} while (next_permutation(s, s + n));
for (int i = 0; i < n - 1; i++) {
printf("Cable requirement to connect (%d,%d) to (%d,%d) is %.2lf feet.\n", p[ans[i].x].x, p[ans[i].x].y, p[ans[i].y].x, p[ans[i].y].y, l1[i] + 16);
}
printf("Number of feet of cable required is %.2lf.\n", min + 16 * (n - 1));
}
return 0;
}