规划
原题链接:
https://www.luogu.com.cn/problem/P1642
题目
题解
首先看题, 求 ∑ a i ∑ b i \frac{\sum a_i} { \sum b_i} ∑bi∑ai的最大值不禁让人联想到0/1分数规划, 然后再看, 这一张图是一棵树, 然后又要选择刚好n - m个节点, 这不就是一个有依赖的背包吗?那么就简单了, 首先我们可以确定一个根节点, 然后我们进行递归, 每次搜到一个节点就按照分组背包装其子节点, 然后若是这样选, 那此节点一定必须选, 就强制放入当前节点的背包。
代码
#include <cstdio>
#include <algorithm>
using namespace std;
#define MAXN 100
#define INF 1<<30
double dp[MAXN + 5][MAXN + 5];//背包
double sa[MAXN + 5], sb[MAXN + 5];//sa:污染, sb:价值
double c[MAXN + 5];//sa - sb * mid
int q[MAXN + 5];//以i节点为根的子树的节点个数
struct node {
int ed;
node *next;
}s[MAXN + 5];//邻接表
void push (int x, int y) {
node *p;
p = new node;
p->ed = y;
p->next = s[x].next;
s[x].next = p;
}
void dfs (int l, int f, int m) {
q[l] = 1;
dp[l][0] = 0;
for (node *i = s[l].next; i != 0; i = i->next) {
if (i->ed == f) {
continue;
}
dfs (i->ed, l, m);
q[l] += q[i->ed];
for (int j = min(q[l], m); j >= 0; j --) {
for (int k = 0; k <= j && k <= q[i->ed]; k ++) {
dp[l][j] = max (dp[l][j], dp[l][j - k] + dp[i->ed][k]);
}
}
}
for (int i = min (m, q[l]); i >= 1; i --) {
dp[l][i] = dp[l][i - 1] + c[l];
}
}
int main () {
int n, m;
scanf ("%d %d", &n, &m);
for (int i = 1; i <= n; i ++) {
scanf ("%lf", &sa[i]);
}
for (int i = 1; i <= n; i ++) {
scanf ("%lf", &sb[i]);
}
for (int i = 1; i < n; i ++) {
int x, y;
scanf ("%d %d", &x, &y);
push (x, y);
push (y, x);
}
double l = 0, r = 1000000;
while (r - l > 1e-4) {
for (int i = 1; i <= n; i ++) {
for (int j = 0; j <= n - m; j ++) {
dp[i][j] = -INF;
}
}
double mid = (l + r) / 2;
for (int i = 1; i <= n; i ++) {
c[i] = sa[i] - sb[i] * mid;
}
dfs (1, 0, n - m);
bool bl = 0;
for (int i = 1; i <= n; i ++) {
if (dp[i][n - m] > -0.000001) {
bl = 1;
break;
}
}
if (bl) {
l = mid;
}
else {
r = mid;
}
}
printf ("%.1lf", l);
}