{"id":3230,"date":"2024-05-01T19:50:32","date_gmt":"2024-05-01T11:50:32","guid":{"rendered":"https:\/\/www.shuizilong.com\/house\/?p=3230"},"modified":"2024-05-02T00:59:40","modified_gmt":"2024-05-01T16:59:40","slug":"top-tree-%e5%ad%a6%e4%b9%a0%e7%ac%94%e8%ae%b0","status":"publish","type":"post","link":"https:\/\/www.shuizilong.com\/house\/archives\/top-tree-%e5%ad%a6%e4%b9%a0%e7%ac%94%e8%ae%b0\/","title":{"rendered":"Top Tree \u5b66\u4e60\u7b14\u8bb0"},"content":{"rendered":"<p><a href=\"https:\/\/atcoder.jp\/contests\/abc351\/tasks\/abc351_g?lang=en\">\u6700\u8fd1\u4e00\u573a\u7684 ABC \u7684\u6700\u540e\u4e00\u9898<\/a>\uff0c<a href=\"https:\/\/atcoder.jp\/contests\/abc351\/editorial\/9899\">\u5b98\u65b9\u9898\u89e3<\/a>\u4ecb\u7ecd\u4e86\u4e00\u79cd\u57fa\u4e8e static top tree \u7684\u505a\u6cd5\uff0c\u867d\u7136\u8fd9\u4e2a\u9898\u660e\u660e\u53ef\u4ee5<a href=\"https:\/\/atcoder.jp\/contests\/abc351\/editorial\/9896\">\u76f4\u63a5\u7528\u6811\u94fe\u5256\u5206<\/a>\u3002<\/p>\n<p>\u7136\u540e\u6211\u53d1\u73b0\u8fd9\u4e2a\u9898\u89e3\u6211\u8bfb\u7684\u5e76\u4e0d\u662f\u5f88\u61c2\uff0c\u4ed4\u7ec6\u590d\u4e60\u4e86\u4e00\u4e0b\u53d1\u73b0\u6211\u4e4b\u524d\u5bf9 top tree \u7684\u7406\u89e3\u6709\u8bef\u533a\u3002\u8bfb\u4e86 <a href=\"https:\/\/negiizhao.blog.uoj.ac\/blog\/4912\">negiizhao \u7684\u6587\u7ae0<\/a>\u540e\u8ba4\u8bc6\u5230\u5e94\u8be5\u4ece\u5386\u53f2\u6587\u732e\u4e2d\u627e\u7ebf\u7d22\uff0c\u6240\u4ee5\uff1a<\/p>\n<blockquote><p>Top Tree: A top tree is a binary tree that embodies a contraction of a tree into a single edge via a sequence of rake and compress operations.<\/p><\/blockquote>\n<p>\u6240\u4ee5\u6839\u636e Tarjan \u7684\u5b9a\u4e49\uff0cTop Tree \u4e00\u5b9a\u662f\u4e00\u4e2a\u53cd\u5e94\u4ece\u72ec\u7acb\u7684\u8fb9\u5f00\u59cb\u53cd\u5411\u901a\u8fc7 rake\/compress \u64cd\u4f5c\u5408\u5e76\u6210\u5355\u4e00\u7c07\u7684\u7ed3\u6784\uff0c\u4e5f\u8bb8\u7c7b\u4f3c\u601d\u8def\u7684\u8fd8\u6709\u8bb0\u5f55\u70b9\u5206\u6cbb\u8fc7\u7a0b\u5f62\u6210\u7684\u70b9\u5206\u6811\uff0cKruskal \u91cd\u6784\u6811\u8fd8\u6709\u5212\u5206\u6811\u3001Gomory\u2013Hu Tree \u8fd9\u7c7b\u7ed3\u6784\u3002<\/p>\n<p>\u5f53\u7136\u5173\u4e8e Link-Cut Tree\u3001Top Tree \u8fd8\u6709 ETT\uff0c\u73b0\u5728\u56e0\u4e3a\u5177\u4f53\u5b9e\u73b0\u7684\u65f6\u5019\u73b0\u5728\u5df2\u7ecf\u4f60\u4e2d\u6709\u6211\uff0c\u6211\u4e2d\u6709\u4f60\uff0c\u6709\u7684\u65f6\u5019\u786e\u5b9e\u4e0d\u597d\u533a\u5206\uff0c\u53ef\u80fd\u5bf9\u7740\u4ee3\u7801\u8bf4\u624d\u66f4\u6e05\u6670\uff0c\u603b\u4e4b\u628a\u8fd9\u4e9b\u5bb9\u6613\u6df7\u6dc6\u7684\u6982\u5ff5\u89e3\u91ca\u6e05\u695a\uff0c\u4e5f<a href=\"https:\/\/www.zhihu.com\/question\/292283275\/answer\/484694411\">\u201c\u662f OI \u754c\u6c34\u5e73\u666e\u904d\u63d0\u9ad8\u3001\u547d\u9898\u89c4\u8303\u5b8c\u5584\u548c\u51fa\u9898\u4eba\u7684\u4f7f\u547d\u611f\u548c\u8d23\u4efb\u5fc3\u589e\u5f3a\u7684\u6700\u597d\u89c1\u8bc1\u3002\u201d<\/a> \u56e7\u3002<\/p>\n<h2>\u53c2\u8003\u8d44\u6599<\/h2>\n<ul>\n<li><a href=\"https:\/\/www.cnblogs.com\/ExplodingKonjac\/p\/17890636.html\">Top Tree \u76f8\u5173\u7406\u8bba\u626f\u6de1<\/a><\/li>\n<li><a href=\"https:\/\/f7487.blog.uoj.ac\/blog\/7490\">SATT(Self-Adjusting Top Tree)\u5b66\u4e60\u7b14\u8bb0<\/a><\/li>\n<li><a href=\"https:\/\/renatowerneck.wordpress.com\/wp-content\/uploads\/2016\/06\/tw05-self-adjusting-top-tree.pdf\">Self-Adjusting Top Trees, Robert E. Tarjan, Renato F. Werneck., 2005<\/a><\/li>\n<li><a href=\"https:\/\/pan.baidu.com\/s\/1hLFyA\">Implementation of Dynamic Trees with In-Subtree Operations, Tomasz Radzik, 1998<\/a><\/li>\n<li><a href=\"\">\u52a8\u6001\u6811\u95ee\u9898\u53ca\u5176\u5e94\u7528, \u8881\u6615\u98a2, 2007<\/a><\/li>\n<li><a href=\"\">\u6d45\u8c08\u52a8\u6001\u6811\u7684\u76f8\u5173\u95ee\u9898\u53ca\u7b80\u5355\u62d3\u5c55, \u9ec4\u5fd7\u7ff1, 2014<\/a><\/li>\n<li><a href=\"\">\u4e00\u79cd\u57fa\u4e8eLCT\u7684\u6811\u4e0a\u540c\u8272\u8fde\u901a\u5757\u7ef4\u62a4\u7b97\u6cd5, \u4efb\u4e4b\u6d32, 2016<\/a><\/li>\n<li><a href=\"\">\u300a\u57fa\u7840\u5706\u65b9\u6811\u7ec3\u4e60\u9898\u300b\u547d\u9898\u62a5\u544a, \u8303\u81f4\u8fdc, 2019<\/a><\/li>\n<li><a href=\"\">\u6d45\u8c08\u9759\u6001 Top Tree \u5728\u6811\u548c\u5e7f\u4e49\u4e32\u5e76\u8054\u56fe\u4e0a\u7684\u5e94\u7528, \u7a0b\u601d\u5143, 2023<\/a><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>\u6700\u8fd1\u4e00\u573a\u7684 ABC \u7684\u6700\u540e\u4e00\u9898\uff0c\u5b98\u65b9\u9898\u89e3\u4ecb\u7ecd\u4e86\u4e00\u79cd\u57fa\u4e8e static top tree \u7684\u505a\u6cd5\uff0c\u867d\u7136\u8fd9\u4e2a\u9898\u660e\u660e\u53ef\u4ee5\u76f4\u63a5\u7528\u6811\u94fe\u5256\u5206\u3002 \u7136\u540e\u6211\u53d1\u73b0\u8fd9\u4e2a\u9898\u89e3\u6211\u8bfb\u7684\u5e76\u4e0d\u662f\u5f88\u61c2\uff0c\u4ed4\u7ec6\u590d\u4e60\u4e86\u4e00\u4e0b\u53d1\u73b0\u6211\u4e4b\u524d\u5bf9 top tree \u7684\u7406\u89e3\u6709\u8bef\u533a\u3002\u8bfb\u4e86 negiizhao \u7684\u6587\u7ae0\u540e\u8ba4\u8bc6\u5230\u5e94\u8be5\u4ece\u5386\u53f2\u6587\u732e\u4e2d\u627e\u7ebf\u7d22\uff0c\u6240\u4ee5\uff1a Top Tree: A top tree is a binary tree that embodies a contraction of a tree into a single edge via a sequence of rake and compress operations. \u6240\u4ee5\u6839\u636e Tarjan \u7684\u5b9a\u4e49\uff0cTop Tree \u4e00\u5b9a\u662f\u4e00\u4e2a\u53cd\u5e94\u4ece\u72ec\u7acb\u7684\u8fb9\u5f00\u59cb\u53cd\u5411\u901a\u8fc7 rake\/compress \u64cd\u4f5c\u5408\u5e76\u6210\u5355\u4e00\u7c07\u7684\u7ed3\u6784\uff0c\u4e5f\u8bb8\u7c7b\u4f3c\u601d\u8def\u7684\u8fd8\u6709\u8bb0\u5f55\u70b9\u5206\u6cbb\u8fc7\u7a0b\u5f62\u6210\u7684\u70b9\u5206\u6811\uff0cKruskal \u91cd\u6784\u6811\u8fd8\u6709\u5212\u5206\u6811\u3001Gomory\u2013Hu Tree \u8fd9\u7c7b\u7ed3\u6784\u3002 \u5f53\u7136\u5173\u4e8e Link-Cut Tree\u3001Top Tree [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","enabled":false}}},"categories":[1],"tags":[],"class_list":["post-3230","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-Q6","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/3230","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/comments?post=3230"}],"version-history":[{"count":14,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/3230\/revisions"}],"predecessor-version":[{"id":3257,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/3230\/revisions\/3257"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=3230"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=3230"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=3230"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}