Commit ea16c13

authored

Create Readme.md

1 parent ca0ce46 commit ea16c13Copy full SHA for ea16c13

File tree

-0

lines changed

Binary_Search/3553.Minimum-Weighted-Subgraph-With-the-Required-Paths-II
- Readme.md

-0

lines changed

Lines changed: 3 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+### 3553.Minimum-Weighted-Subgraph-With-the-Required-Paths-II`
	`2`	`+`
	`3`	+本题的第一个知识点是:在一棵树里,联通u,v,w三个节点的最小子树的权重和,就是`[dist(u,v)+dist(u,w)+dist(v,w)]/2`.

Comments

(0)