Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-120F\":[\"Spiders\",3797,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/120\\\"\\u003eSchool Regional Team Contest, Saratov, 2011\\u003c/a\\u003e\"],\"CodeForces-1294F\":[\"Three Paths on a Tree\",5710,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1294\\\"\\u003eCodeforces Round 615 (Div. 3)\\u003c/a\\u003e\"],\"洛谷-P3304\":[\"直径\",2801,\"SDOI2013\"],\"CodeForces-1822F\":[\"Gardening Friends\",5659,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1822\\\"\\u003eCodeforces Round 867 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-14D\":[\"Two Paths\",4724,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/14\\\"\\u003eCodeforces Beta Round 14 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-734E\":[\"Anton and Tree\",4380,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/734\\\"\\u003eCodeforces Round 379 (Div. 2)\\u003c/a\\u003e\"],\"POJ-1985\":[\"Cow Marathon\",3758,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+February\\\"\\u003eUSACO 2004 February\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-1881F\":[\"Minimum Maximum Distance\",6165,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1881\\\"\\u003eCodeforces Round 903 (Div. 3)\\u003c/a\\u003e\"],\"SPOJ-PT07Z\":[\"Longest path in a tree\",22026,\"Co-author Amber\"],\"CodeForces-592D\":[\"Super M\",2556,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/592\\\"\\u003eCodeforces Round 328 (Div. 2)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"Exile_code","updateTime":1712885789000,"title":"进阶图论(树上问题)","dislikeCnt":0,"content":"\n### 树的直径\n1. [树形DP 求树的直径模板视频]( https://www.bilibili.com/video/BV1ni4y157s3?vd_source\u003daffb7616e4b4bb9edc2495f2da9d64e9 )\n2. [两次bfs 求树的直径模板文章](https://blog.csdn.net/qq_31036127/article/details/106670797)\n3. [树的直径,树的中心性质整理](https://www.cnblogs.com/crab-in-the-northeast/p/diameter-and-center-on-tree.html)\n4. 视频:[树的直径 以及证明](https://www.bilibili.com/video/BV1cW421w7y5?vd_source\u003daffb7616e4b4bb9edc2495f2da9d64e9)\n[problem:SPOJ-PT07Z] 裸的模板题 黄\n[problem:POJ-1985] 裸的模板题 黄左右\n[problem:CodeForces-120F] 性质四 1400(两个树链接后,新直径的端点是之前四个点的其中之二)\n[problem:洛谷-P3304]性质七 绿(直径重合的链只有一条且必然连续,求直径后lca乱搞/暴力搜索每条直径点的交集)\n[problem:CodeForces-1822F]1700(性质二:距离一个点最远的点必然是直径两个端点之一)\n[problem:CodeForces-1881F]1700(性质二 枚举/推理)\n[problem:CodeForces-14D]1900(断边+暴力枚举)\n[problem:CodeForces-1294F]2000(性质二+枚举)\n[problem:CodeForces-734E]2100(反转的性质(或连通块缩点)+思维推理)\n[problem:CodeForces-592D]2200(注:跟某一道蓝桥题目重了)(提示:ans\u003d所有跨在直径上的带关键点的分支长度x2+直径长度 )\n### 树的重心\n### 树链刨分\n### 树上启发式合并\n### 虚树\n### 树分治\n### 树哈希(同构树)\n\n","threadId":187535,"likeCnt":3,"createTime":1711089396000,"isWorkbook":true,"viewCnt":483,"openness":2,"fav":false,"id":4734,"trustable":false}