# POJ2728-Desert King（最优比率生成树）

112人阅读 评论(0)

### 题目链接

http://poj.org/problem?id=2728

0-1规划问题

### 代码

#include <iostream>
#include <cstring>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <sstream>
#include <iomanip>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <bitset>
#include <algorithm>
using namespace std;

#define PI acos(-1.0)
#define LL long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define mp make_pair
#define IN freopen("in.txt", "r", stdin)
#define OUT freopen("out.txt", "wb", stdout)
#define scan(x) scanf("%d", &x)
#define scan2(x, y) scanf("%d%d", &x, &y)
#define scan3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define sqr(x) (x) * (x)
#define pr(x) cout << #x << " = " << x << endl
#define lc o << 1
#define rc o << 1 | 1
#define pl() cout << endl
#define CLR(a, x) memset(a, x, sizeof(a))
#define FILL(a, n, x) for (int i = 0; i < n; i++) a[i] = x

const int maxn = 1000 + 5;
const int maxm = 1000000 + 5;
const double INF = 0x7f7f7f7f;
const double eps = 1e-6;

int n, m;
double l[maxn][maxn], w[maxn][maxn], g[maxn][maxn];
struct node {
int x, y, z;
} a[maxn];

double mincost[maxn];
bool use[maxn];
bool prim() {
FILL(mincost, n, INF);
CLR(use, 0);
mincost[0] = 0;
double res = 0;
while (1) {
int v = -1;
for (int u = 0; u < n; u++) {
if (!use[u] && (v == -1 || mincost[u] < mincost[v])) v = u;
}
if (v == -1) break;
use[v] = 1;
res += mincost[v];
for (int u = 0; u < n; u++) mincost[u] = min(mincost[u], g[v][u]);
}
return res <= 0;
}

bool judge(double x) {
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++)
g[i][j] = g[j][i] = w[i][j] - x * l[i][j];
}
return prim();
}

double dist(int i, int j) {
return sqrt(sqr(double(a[i].x - a[j].x)) + sqr(double(a[i].y - a[j].y)));
}

int main() {
while (scan(n) && n) {
for (int i = 0; i < n; i++) scan3(a[i].x, a[i].y, a[i].z);
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
l[i][j] = l[j][i] = dist(i, j);
w[i][j] = w[j][i] = fabs(double(a[i].z - a[j].z));
}
}
double L = 0.0, R = INF, M;
while (R - L > eps) {
M = (L + R) / 2;
if (judge(M)) R = M;
else L = M;
}
printf("%.3lf\n", M);
}
return 0;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：36376次
• 积分：2756
• 等级：
• 排名：第13488名
• 原创：254篇
• 转载：0篇
• 译文：0篇
• 评论：1条
友链
阅读排行
最新评论