OSDN Git Service
(root)
/
oi-wiki
/
main.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
| inline |
side by side
(parent:
bcd6fe5
)
Update fractional-programming.md
author
心旷神怡
<greyqz@126.com>
Sat, 6 Oct 2018 09:17:28 +0000
(17:17 +0800)
committer
GitHub
<noreply@github.com>
Sat, 6 Oct 2018 09:17:28 +0000
(17:17 +0800)
docs/misc/fractional-programming.md
patch
|
blob
|
history
diff --git
a/docs/misc/fractional-programming.md
b/docs/misc/fractional-programming.md
index
05af295
..
78d9963
100644
(file)
--- a/
docs/misc/fractional-programming.md
+++ b/
docs/misc/fractional-programming.md
@@
-1,5
+1,5
@@
!!! note " 例题 [ luogu P4322 \[JSOI2016\] 最佳团体 ](https://www.luogu.org/problemnew/show/P4322)"
- 题目大意:有一棵 $n+1$ 个结点的树,根为 $0$ 号结点。每个结点 $i$ 有一个价值 $p_i$ 和费用 $s_i$ 。你需要选择 $k$ 个结点 $a_1,a_2,
...
,a_k$ (不包括 $0$ 号结点),使得
+ 题目大意:有一棵 $n+1$ 个结点的树,根为 $0$ 号结点。每个结点 $i$ 有一个价值 $p_i$ 和费用 $s_i$ 。你需要选择 $k$ 个结点 $a_1,a_2,
\ldots
,a_k$ (不包括 $0$ 号结点),使得
$$
\frac{\sum_{i=1}^k p_{a_i}}{\sum_{i=1}^k s_{a_i}}