Commit 15d768f4 authored by 24OI-bot's avatar 24OI-bot
Browse files

style: format markdown files with remark-lint

parent d6446d1e

docs/dp/tree.md

+55 −56
Original line number Diff line number Diff line
@@ -60,14 +60,14 @@ int main() { 
    }

}

```



### 习题



-  [HDU 2196 Computer](http://acm.hdu.edu.cn/showproblem.php?pid=2196) 



-  [POJ 1463 Strategic game](http://poj.org/problem?id=1463) 



-  [[POI2014]FAR-FarmCraft](https://www.luogu.com.cn/problem/P3574)



-  [\[POI2014\]FAR-FarmCraft](https://www.luogu.com.cn/problem/P3574) 



## 树上背包
@@ -137,7 +137,7 @@ $$ 


### 习题



-  [[CTSC1997] 选课](https://www.luogu.com.cn/problem/P2014)

-  [\[CTSC1997\] 选课](https://www.luogu.com.cn/problem/P2014) 



-  [「JSOI2018」潜入行动](https://loj.ac/problem/2546)
@@ -237,13 +237,12 @@ $f_v\leftarrow f_u$可以体现换根，即以$u$为根转移到以$v$为根。 


-  [POJ 3585 Accumulation Degree](http://poj.org/problem?id=3585) 



-  [[POI2008]STA-Station](https://www.luogu.com.cn/problem/P3478)

-  [\[POI2008\]STA-Station](https://www.luogu.com.cn/problem/P3478) 



-  [[USACO10MAR]Great Cow Gathering G](https://www.luogu.com.cn/problem/P2986)

-  [\[USACO10MAR\]Great Cow Gathering G](https://www.luogu.com.cn/problem/P2986) 



-  [CodeForce 708C Centroids](http://codeforces.com/problemset/problem/708/C) 



## 参考资料与注释



[^note1]:  [子树合并背包类型的 dp 的复杂度证明 - LYD729 的 CSDN 博客](https://blog.csdn.net/lyd_7_29/article/details/79854245)