Home Explore Help
Register Sign In
schtonn
/
public
1
1
Fork 0
Files Issues 0 Pull Requests 0 Wiki
Tree: 251bb196a5
Branches Tags
public
/
posts
/
tree-link
/
index.html

index.html 50 KB
History Raw

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568 
  1. <!DOCTYPE html>
    2. 

  2. <html lang="en">
    3. 

  3. <head>
    4. 

  4.   <meta charset="UTF-8">
    5. 

  5. <meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=2">
    6. 

  6. <meta name="theme-color" content="#222">
    7. 

  7. <meta name="generator" content="Hexo 4.2.0">
    8. 

  8.   <link rel="apple-touch-icon" sizes="180x180" href="/images/apple-touch-icon-next.png">
    9. 

  9.   <link rel="icon" type="image/png" sizes="32x32" href="/images/favicon-32x32-next.png">
    10. 

  10.   <link rel="icon" type="image/png" sizes="16x16" href="/images/favicon-16x16-next.png">
    11. 

  11.   <link rel="mask-icon" href="/images/logo.svg" color="#222">
    12. 

  12. 

  13. <link rel="stylesheet" href="/css/main.css">
    14. 

  14. 

  15. 

  16. <link rel="stylesheet" href="/lib/font-awesome/css/font-awesome.min.css">
    17. 

  17.   <link rel="stylesheet" href="/lib/pace/pace-theme-minimal.min.css">
    18. 

  18.   <script src="/lib/pace/pace.min.js"></script>
    19. 

  19. 

  20. <script id="hexo-configurations">
    21. 

  21.     var NexT = window.NexT || {};
    22. 

  22.     var CONFIG = {"hostname":"schtonn.github.io","root":"/","scheme":"Muse","version":"7.8.0","exturl":false,"sidebar":{"position":"left","display":"post","padding":18,"offset":12,"onmobile":false},"copycode":{"enable":true,"show_result":true,"style":"flat"},"back2top":{"enable":true,"sidebar":false,"scrollpercent":true},"bookmark":{"enable":false,"color":"#222","save":"auto"},"fancybox":false,"mediumzoom":false,"lazyload":true,"pangu":false,"comments":{"style":"tabs","active":"valine","storage":true,"lazyload":false,"nav":null,"activeClass":"valine"},"algolia":{"hits":{"per_page":10},"labels":{"input_placeholder":"Search for Posts","hits_empty":"We didn't find any results for the search: ${query}","hits_stats":"${hits} results found in ${time} ms"}},"localsearch":{"enable":false,"trigger":"auto","top_n_per_article":1,"unescape":false,"preload":false},"motion":{"enable":true,"async":false,"transition":{"post_block":"fadeIn","post_header":"slideDownIn","post_body":"slideDownIn","coll_header":"slideLeftIn","sidebar":"slideUpIn"}}};
    23. 

  23.   </script>
    24. 

  24. 

  25.   <meta name="description" content="前置知识 必备：存图方式（邻接表，邻接矩阵），dfs序。 维护：线段树、树状数组、BST。 不会的快进入链接学习吧！  引入 树链剖分，简单来说就是把树分割成链，然后维护每一条链。一般的维护算法有线段树，树状数组和BST。复杂度为O(logn)O(log n)O(logn)。">
    26. 

  26. <meta property="og:type" content="article">
    27. 

  27. <meta property="og:title" content="树链剖分">
    28. 

  28. <meta property="og:url" content="https://schtonn.github.io/posts/tree-link/index.html">
    29. 

  29. <meta property="og:site_name" content="Alex&#39;s Blog">
    30. 

  30. <meta property="og:description" content="前置知识 必备：存图方式（邻接表，邻接矩阵），dfs序。 维护：线段树、树状数组、BST。 不会的快进入链接学习吧！  引入 树链剖分，简单来说就是把树分割成链，然后维护每一条链。一般的维护算法有线段树，树状数组和BST。复杂度为O(logn)O(log n)O(logn)。">
    31. 

  31. <meta property="og:locale" content="en_US">
    32. 

  32. <meta property="og:image" content="https://img-blog.csdnimg.cn/20191228195815530.png">
    33. 

  33. <meta property="article:published_time" content="2020-03-01T14:41:02.000Z">
    34. 

  34. <meta property="article:modified_time" content="2020-03-29T07:59:54.282Z">
    35. 

  35. <meta property="article:author" content="Alex">
    36. 

  36. <meta property="article:tag" content="graph">
    37. 

  37. <meta name="twitter:card" content="summary">
    38. 

  38. <meta name="twitter:image" content="https://img-blog.csdnimg.cn/20191228195815530.png">
    39. 

  39. 

  40. <link rel="canonical" href="https://schtonn.github.io/posts/tree-link/">
    41. 

  41. 

  42. 

  43. <script id="page-configurations">
    44. 

  44.   // https://hexo.io/docs/variables.html
    45. 

  45.   CONFIG.page = {
    46. 

  46.     sidebar: "",
    47. 

  47.     isHome : false,
    48. 

  48.     isPost : true,
    49. 

  49.     lang   : 'en'
    50. 

  50.   };
    51. 

  51. </script>
    52. 

  52. 

  53.   <title>树链剖分 | Alex's Blog</title>
    54. 

  54.   
    55. 

  55. 

  56. 

  57. 

  58. 

  59. 

  60. 

  61.   <noscript>
    62. 

  62.   <style>
    63. 

  63.   .use-motion .brand,
    64. 

  64.   .use-motion .menu-item,
    65. 

  65.   .sidebar-inner,
    66. 

  66.   .use-motion .post-block,
    67. 

  67.   .use-motion .pagination,
    68. 

  68.   .use-motion .comments,
    69. 

  69.   .use-motion .post-header,
    70. 

  70.   .use-motion .post-body,
    71. 

  71.   .use-motion .collection-header { opacity: initial; }
    72. 

  72. 

  73.   .use-motion .site-title,
    74. 

  74.   .use-motion .site-subtitle {
    75. 

  75.     opacity: initial;
    76. 

  76.     top: initial;
    77. 

  77.   }
    78. 

  78. 

  79.   .use-motion .logo-line-before i { left: initial; }
    80. 

  80.   .use-motion .logo-line-after i { right: initial; }
    81. 

  81.   </style>
    82. 

  82. </noscript>
    83. 

  83. 

  84. </head>
    85. 

  85. 

  86. <body itemscope itemtype="http://schema.org/WebPage">
    87. 

  87.   <div class="container use-motion">
    88. 

  88.     <div class="headband"></div>
    89. 

  89. 

  90.     <header class="header" itemscope itemtype="http://schema.org/WPHeader">
    91. 

  91.       <div class="header-inner"><div class="site-brand-container">
    92. 

  92.   <div class="site-nav-toggle">
    93. 

  93.     <div class="toggle" aria-label="Toggle navigation bar">
    94. 

  94.       <span class="toggle-line toggle-line-first"></span>
    95. 

  95.       <span class="toggle-line toggle-line-middle"></span>
    96. 

  96.       <span class="toggle-line toggle-line-last"></span>
    97. 

  97.     </div>
    98. 

  98.   </div>
    99. 

  99. 

  100.   <div class="site-meta">
    101. 

  101. 

  102.     <a href="/" class="brand" rel="start">
    103. 

  103.       <span class="logo-line-before"><i></i></span>
    104. 

  104.       <h1 class="site-title">Alex's Blog</h1>
    105. 

  105.       <span class="logo-line-after"><i></i></span>
    106. 

  106.     </a>
    107. 

  107.       <p class="site-subtitle" itemprop="description">Middle school OIer</p>
    108. 

  108.   </div>
    109. 

  109. 

  110.   <div class="site-nav-right">
    111. 

  111.     <div class="toggle popup-trigger">
    112. 

  112.     </div>
    113. 

  113.   </div>
    114. 

  114. </div>
    115. 

  115. 

  116. 

  117. 

  118. 

  119. <nav class="site-nav">
    120. 

  120.   <ul id="menu" class="menu">
    121. 

  121.         <li class="menu-item menu-item-home">
    122. 

  122. 

  123.     <a href="/" rel="section"><i class="fa fa-fw fa-home"></i>Home</a>
    124. 

  124. 

  125.   </li>
    126. 

  126.         <li class="menu-item menu-item-tags">
    127. 

  127. 

  128.     <a href="/tags/" rel="section"><i class="fa fa-fw fa-tags"></i>Tags</a>
    129. 

  129. 

  130.   </li>
    131. 

  131.         <li class="menu-item menu-item-archives">
    132. 

  132. 

  133.     <a href="/archives/" rel="section"><i class="fa fa-fw fa-archive"></i>Archives</a>
    134. 

  134. 

  135.   </li>
    136. 

  136.         <li class="menu-item menu-item-games">
    137. 

  137. 

  138.     <a href="/games/" rel="section"><i class="fa fa-fw fa-gamepad"></i>Games</a>
    139. 

  139. 

  140.   </li>
    141. 

  141.         <li class="menu-item menu-item-sans">
    142. 

  142. 

  143.     <a href="/sans/" rel="section"><i class="fa fa-fw fa-heart"></i>sans</a>
    144. 

  144. 

  145.   </li>
    146. 

  146.   </ul>
    147. 

  147. </nav>
    148. 

  148. 

  149. 

  150. 

  151. 

  152. </div>
    153. 

  153.     </header>
    154. 

  154. 

  155.     
    156. 

  156.   <div class="back-to-top">
    157. 

  157.     <i class="fa fa-arrow-up"></i>
    158. 

  158.     <span>0%</span>
    159. 

  159.   </div>
    160. 

  160.   <div class="reading-progress-bar"></div>
    161. 

  161. 

  162. 

  163.     <main class="main">
    164. 

  164.       <div class="main-inner">
    165. 

  165.         <div class="content-wrap">
    166. 

  166.           
    167. 

  167. 

  168.           <div class="content post posts-expand">
    169. 

  169.             
    170. 

  170. 

  171.     
    172. 

  172.   
    173. 

  173.   
    174. 

  174.   <article itemscope itemtype="http://schema.org/Article" class="post-block" lang="en">
    175. 

  175.     <link itemprop="mainEntityOfPage" href="https://schtonn.github.io/posts/tree-link/">
    176. 

  176. 

  177.     <span hidden itemprop="author" itemscope itemtype="http://schema.org/Person">
    178. 

  178.       <meta itemprop="image" content="/images/avatar.gif">
    179. 

  179.       <meta itemprop="name" content="Alex">
    180. 

  180.       <meta itemprop="description" content="The blog of a middle school OIer">
    181. 

  181.     </span>
    182. 

  182. 

  183.     <span hidden itemprop="publisher" itemscope itemtype="http://schema.org/Organization">
    184. 

  184.       <meta itemprop="name" content="Alex's Blog">
    185. 

  185.     </span>
    186. 

  186.       <header class="post-header">
    187. 

  187.         <h1 class="post-title" itemprop="name headline">
    188. 

  188.           树链剖分
    189. 

  189.         </h1>
    190. 

  190. 

  191.         <div class="post-meta">
    192. 

  192.             <span class="post-meta-item">
    193. 

  193.               <span class="post-meta-item-icon">
    194. 

  194.                 <i class="fa fa-calendar-o"></i>
    195. 

  195.               </span>
    196. 

  196.               <span class="post-meta-item-text">Posted on</span>
    197. 

  197. 

  198.               <time title="Created: 2020-Mar-01 22:41:02" itemprop="dateCreated datePublished" datetime="2020-03-01T22:41:02+08:00">2020-Mar-01</time>
    199. 

  199.             </span>
    200. 

  200.               <span class="post-meta-item">
    201. 

  201.                 <span class="post-meta-item-icon">
    202. 

  202.                   <i class="fa fa-calendar-check-o"></i>
    203. 

  203.                 </span>
    204. 

  204.                 <span class="post-meta-item-text">Edited on</span>
    205. 

  205.                 <time title="Modified: 2020-Mar-29 15:59:54" itemprop="dateModified" datetime="2020-03-29T15:59:54+08:00">2020-Mar-29</time>
    206. 

  206.               </span>
    207. 

  207. 

  208.           
    209. 

  209.             <span id="/posts/tree-link/" class="post-meta-item leancloud_visitors" data-flag-title="树链剖分" title="Views">
    210. 

  210.               <span class="post-meta-item-icon">
    211. 

  211.                 <i class="fa fa-eye"></i>
    212. 

  212.               </span>
    213. 

  213.               <span class="post-meta-item-text">Views: </span>
    214. 

  214.               <span class="leancloud-visitors-count"></span>
    215. 

  215.             </span>
    216. 

  216.   
    217. 

  217.   <span class="post-meta-item">
    218. 

  218.     
    219. 

  219.       <span class="post-meta-item-icon">
    220. 

  220.         <i class="fa fa-comment-o"></i>
    221. 

  221.       </span>
    222. 

  222.       <span class="post-meta-item-text">Valine: </span>
    223. 

  223.     
    224. 

  224.     <a title="valine" href="/posts/tree-link/#valine-comments" itemprop="discussionUrl">
    225. 

  225.       <span class="post-comments-count valine-comment-count" data-xid="/posts/tree-link/" itemprop="commentCount"></span>
    226. 

  226.     </a>
    227. 

  227.   </span>
    228. 

  228.   
    229. 

  229.   
    230. 

  230. 

  231.         </div>
    232. 

  232.       </header>
    233. 

  233. 

  234.     
    235. 

  235.     
    236. 

  236.     
    237. 

  237.     <div class="post-body" itemprop="articleBody">
    238. 

  238. 

  239.       
    240. 

  240.         <h3 id="前置知识"><a class="markdownIt-Anchor" href="#前置知识"></a> 前置知识</h3>
    241. 

  241. <p>必备：存图方式（<a href="http://baidu.physton.com/?q=%E9%82%BB%E6%8E%A5%E8%A1%A8" target="_blank" rel="noopener" title="简单">邻接表</a>，<a href="http://baidu.physton.com/?q=%E9%82%BB%E6%8E%A5%E7%9F%A9%E9%98%B5" target="_blank" rel="noopener" title="都太简单了，没有一个打得过的">邻接矩阵</a>），<a href="http://baidu.physton.com/?q=dfs%E5%BA%8F" target="_blank" rel="noopener">dfs序</a>。<br />
    242. 

  242. 维护：<a href="http://baidu.physton.com/?q=%E7%BA%BF%E6%AE%B5%E6%A0%91" target="_blank" rel="noopener">线段树</a>、<a href="http://baidu.physton.com/?q=%E6%A0%91%E7%8A%B6%E6%95%B0%E7%BB%84" target="_blank" rel="noopener">树状数组</a>、<a href="http://baidu.physton.com/?q=BST" target="_blank" rel="noopener">BST</a>。<br />
    243. 

  243. 不会的快进入链接学习吧！</p>
    244. 

  244. <h3 id="引入"><a class="markdownIt-Anchor" href="#引入"></a> 引入</h3>
    245. 

  245. <p>树链剖分，简单来说就是把树分割成链，然后维护每一条链。一般的维护算法有线段树，树状数组和BST。复杂度为<span class="katex"><span class="katex-mathml"><math><semantics><mrow><mi>O</mi><mo stretchy="false">(</mo><mi>l</mi><mi>o</mi><mi>g</mi><mi>n</mi><mo stretchy="false">)</mo></mrow><annotation encoding="application/x-tex">O(log n)</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord mathdefault" style="margin-right:0.02778em;">O</span><span class="mopen">(</span><span class="mord mathdefault" style="margin-right:0.01968em;">l</span><span class="mord mathdefault">o</span><span class="mord mathdefault" style="margin-right:0.03588em;">g</span><span class="mord mathdefault">n</span><span class="mclose">)</span></span></span></span>。</p>
    246. 

  246. <a id="more"></a>
    247. 

  247. <h3 id="剖分方式"><a class="markdownIt-Anchor" href="#剖分方式"></a> 剖分方式</h3>
    248. 

  248. <p>对于每一个节点，它的子节点中<strong>子树的节点数最大的</strong>为重儿子，连接到重儿子的边称为重边。例如：<br />
    249. 

  249. <img data-src="https://img-blog.csdnimg.cn/20191228195815530.png" alt="" /><br />
    250. 

  250. 加粗节点为重儿子。<span class="katex"><span class="katex-mathml"><math><semantics><mrow><mn>4</mn></mrow><annotation encoding="application/x-tex">4</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.64444em;vertical-align:0em;"></span><span class="mord">4</span></span></span></span><span class="katex"><span class="katex-mathml"><math><semantics><mrow><mn>5</mn></mrow><annotation encoding="application/x-tex">5</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.64444em;vertical-align:0em;"></span><span class="mord">5</span></span></span></span><span class="katex"><span class="katex-mathml"><math><semantics><mrow><mn>6</mn></mrow><annotation encoding="application/x-tex">6</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.64444em;vertical-align:0em;"></span><span class="mord">6</span></span></span></span>节点的重量都一样，所以你想上哪个成为重儿子那个就是重儿子。除重儿子和重边外的节点和边均为轻儿子或轻边。根不是重儿子也不是轻儿子 <s>，有脑子的人都会想一想，它根本就不是什么儿子！</s> 。<br />
    251. 

  251. 以轻儿子或者根为起点的，由重边连接的一条连续的链称为重链。特别地，若一个叶子结点是轻儿子，那么便有一条以该叶子结点为起点的长度为1的重链。上图中，<span class="katex"><span class="katex-mathml"><math><semantics><mrow><mn>1</mn><mo>−</mo><mn>3</mn><mo>−</mo><mn>7</mn><mo>−</mo><mn>9</mn></mrow><annotation encoding="application/x-tex">1-3-7-9</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.72777em;vertical-align:-0.08333em;"></span><span class="mord">1</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span></span><span class="base"><span class="strut" style="height:0.72777em;vertical-align:-0.08333em;"></span><span class="mord">3</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span></span><span class="base"><span class="strut" style="height:0.72777em;vertical-align:-0.08333em;"></span><span class="mord">7</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span><span class="mbin">−</span><span class="mspace" style="margin-right:0.2222222222222222em;"></span></span><span class="base"><span class="strut" style="height:0.64444em;vertical-align:0em;"></span><span class="mord">9</span></span></span></span>是一条重链，<span class="katex"><span class="katex-mathml"><math><semantics><mrow><mn>6</mn></mrow><annotation encoding="application/x-tex">6</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.64444em;vertical-align:0em;"></span><span class="mord">6</span></span></span></span>一个节点也是一条重链。</p>
    252. 

  252. <h3 id="预处理"><a class="markdownIt-Anchor" href="#预处理"></a> 预处理</h3>
    253. 

  253. <p>树链剖分的预处理本质上就是2个dfs。</p>
    254. 

  254. <h4 id="dfs-no1"><a class="markdownIt-Anchor" href="#dfs-no1"></a> dfs NO.1</h4>
    255. 

  255. <p>一共完成四项任务。</p>
    256. 

  256. <ul>
    257. 

  257. <li>标记节点深度：<span class="katex"><span class="katex-mathml"><math><semantics><mrow><mi>d</mi><mi>e</mi><mi>p</mi><mo stretchy="false">[</mo><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">dep[]</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord mathdefault">d</span><span class="mord mathdefault">e</span><span class="mord mathdefault">p</span><span class="mopen">[</span><span class="mclose">]</span></span></span></span></li>
    258. 

  258. <li>标记节点的父节点：<span class="katex"><span class="katex-mathml"><math><semantics><mrow><mi>f</mi><mi>a</mi><mo stretchy="false">[</mo><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">fa[]</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord mathdefault" style="margin-right:0.10764em;">f</span><span class="mord mathdefault">a</span><span class="mopen">[</span><span class="mclose">]</span></span></span></span></li>
    259. 

  259. <li>标记节点的子树大小：<span class="katex"><span class="katex-mathml"><math><semantics><mrow><mi>s</mi><mi>i</mi><mi>z</mi><mo stretchy="false">[</mo><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">siz[]</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord mathdefault">s</span><span class="mord mathdefault">i</span><span class="mord mathdefault" style="margin-right:0.04398em;">z</span><span class="mopen">[</span><span class="mclose">]</span></span></span></span></li>
    260. 

  260. <li>标记节点的重儿子编号：<span class="katex"><span class="katex-mathml"><math><semantics><mrow><mi>s</mi><mi>o</mi><mi>n</mi><mo stretchy="false">[</mo><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">son[]</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord mathdefault">s</span><span class="mord mathdefault">o</span><span class="mord mathdefault">n</span><span class="mopen">[</span><span class="mclose">]</span></span></span></span></li>
    261. 

  261. </ul>
    262. 

  262. <p>代码：</p>
    263. 

  263. <figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">dfs_1</span><span class="params">(<span class="keyword">int</span> u,<span class="keyword">int</span> f)</span></span>&#123;</span><br><span class="line">    siz[u]=<span class="number">1</span>;</span><br><span class="line">    <span class="keyword">int</span> maxson=<span class="number">-1</span>;</span><br><span class="line">    <span class="keyword">for</span>(<span class="keyword">int</span> i=head[u];i!=<span class="number">-1</span>;i=edge[i].nxt)&#123;</span><br><span class="line">		<span class="keyword">int</span> v=edge[i].v;</span><br><span class="line">        <span class="keyword">if</span>(v==f) <span class="keyword">continue</span>;</span><br><span class="line">		fa[v]=u;</span><br><span class="line">		dep[v]=dep[u]+<span class="number">1</span>;</span><br><span class="line">		dfs_1(v,u);</span><br><span class="line">        siz[u]+=siz[v];</span><br><span class="line">        <span class="keyword">if</span>(siz[v]&gt;siz[son[u]])son[u]=v;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
    264. 

  264. <h4 id="dfs-no2"><a class="markdownIt-Anchor" href="#dfs-no2"></a> dfs NO.2</h4>
    265. 

  265. <p>完成三项任务。</p>
    266. 

  266. <ul>
    267. 

  267. <li>标记dfs序（先重后轻）：<span class="katex"><span class="katex-mathml"><math><semantics><mrow><mi>i</mi><mi>d</mi><mi>x</mi><mo stretchy="false">[</mo><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">idx[]</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord mathdefault">i</span><span class="mord mathdefault">d</span><span class="mord mathdefault">x</span><span class="mopen">[</span><span class="mclose">]</span></span></span></span></li>
    268. 

  268. <li>标记dfs序对应的节点：<span class="katex"><span class="katex-mathml"><math><semantics><mrow><mi>r</mi><mi>n</mi><mi>k</mi><mo stretchy="false">[</mo><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">rnk[]</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord mathdefault" style="margin-right:0.02778em;">r</span><span class="mord mathdefault">n</span><span class="mord mathdefault" style="margin-right:0.03148em;">k</span><span class="mopen">[</span><span class="mclose">]</span></span></span></span></li>
    269. 

  269. <li>标记节点所在重链的顶端：<span class="katex"><span class="katex-mathml"><math><semantics><mrow><mi>t</mi><mi>o</mi><mi>p</mi><mo stretchy="false">[</mo><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">top[]</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mord mathdefault">t</span><span class="mord mathdefault">o</span><span class="mord mathdefault">p</span><span class="mopen">[</span><span class="mclose">]</span></span></span></span></li>
    270. 

  270. </ul>
    271. 

  271. <p>代码：</p>
    272. 

  272. <figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br></pre></td><td class="code"><pre><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">dfs_2</span><span class="params">(<span class="keyword">int</span> u,<span class="keyword">int</span> tp)</span></span>&#123;</span><br><span class="line">    idx[u]=++dfn;</span><br><span class="line">    rnk[dfn]=a[u];</span><br><span class="line">    top[u]=tp;</span><br><span class="line">    <span class="keyword">if</span>(!son[u])<span class="keyword">return</span>;</span><br><span class="line">    dfs_2(son[u],tp);</span><br><span class="line">    <span class="keyword">for</span>(<span class="keyword">int</span> i=head[u];i!=<span class="number">-1</span>;i=edge[i].nxt)&#123;</span><br><span class="line">        <span class="keyword">if</span>(!idx[edge[i].v])&#123;</span><br><span class="line">            dfs_2(edge[i].v,edge[i].v);</span><br><span class="line">		&#125;</span><br><span class="line">	&#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
    273. 

  273. <h3 id="维护"><a class="markdownIt-Anchor" href="#维护"></a> 维护</h3>
    274. 

  274. <p>这里以洛谷的<a href="https://www.luogu.com.cn/problem/P3384" target="_blank" rel="noopener">P3384</a>为例<br />
    275. 

  275. 要求维护四种操作：</p>
    276. 

  276. <ul>
    277. 

  277. <li>操作1： 格式： 1 x y z 表示将树从x到y结点最短路径上所有节点的值都加上z</li>
    278. 

  278. <li>操作2： 格式： 2 x y 表示求树从x到y结点最短路径上所有节点的值之和</li>
    279. 

  279. <li>操作3： 格式： 3 x z 表示将以x为根节点的子树内所有节点值都加上z</li>
    280. 

  280. <li>操作4： 格式： 4 x 表示求以x为根节点的子树内所有节点值之和</li>
    281. 

  281. </ul>
    282. 

  282. <ol>
    283. 

  283. <li>
    284. 

  284. <p>要处理两点间的路径时：<br />
    285. 

  285. 首先找到两个节点中较深的那个点，然后将对该店所在链进行处理，并将该点移动至所在链顶端节点<strong>的父节点</strong>。因为是按照轻重边为优先级做的dfs，所以一条链上的编号一定是连续的。<br />
    286. 

  286. 循环执行直到两个点在一条链上，这时再处理两个点之间的区间即可。</p>
    287. 

  287. </li>
    288. 

  288. <li>
    289. 

  289. <p>要处理一个点的子树时：<br />
    290. 

  290. 因为是dfs序，所以子树的dfs序一定是连续的区间，直接处理该区间即可。</p>
    291. 

  291. </li>
    292. 

  292. </ol>
    293. 

  293. <p>因为都是处理区间，所以用线段树维护。</p>
    294. 

  294. <h3 id="完整代码"><a class="markdownIt-Anchor" href="#完整代码"></a> 完整代码</h3>
    295. 

  295. <p>因为题目中还有一个毒瘤%p，所以代码显得很繁杂。</p>
    296. 

  296. <figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br><span class="line">72</span><br><span class="line">73</span><br><span class="line">74</span><br><span class="line">75</span><br><span class="line">76</span><br><span class="line">77</span><br><span class="line">78</span><br><span class="line">79</span><br><span class="line">80</span><br><span class="line">81</span><br><span class="line">82</span><br><span class="line">83</span><br><span class="line">84</span><br><span class="line">85</span><br><span class="line">86</span><br><span class="line">87</span><br><span class="line">88</span><br><span class="line">89</span><br><span class="line">90</span><br><span class="line">91</span><br><span class="line">92</span><br><span class="line">93</span><br><span class="line">94</span><br><span class="line">95</span><br><span class="line">96</span><br><span class="line">97</span><br><span class="line">98</span><br><span class="line">99</span><br><span class="line">100</span><br><span class="line">101</span><br><span class="line">102</span><br><span class="line">103</span><br><span class="line">104</span><br><span class="line">105</span><br><span class="line">106</span><br><span class="line">107</span><br><span class="line">108</span><br><span class="line">109</span><br><span class="line">110</span><br><span class="line">111</span><br><span class="line">112</span><br><span class="line">113</span><br><span class="line">114</span><br><span class="line">115</span><br><span class="line">116</span><br><span class="line">117</span><br><span class="line">118</span><br><span class="line">119</span><br><span class="line">120</span><br><span class="line">121</span><br><span class="line">122</span><br><span class="line">123</span><br><span class="line">124</span><br><span class="line">125</span><br><span class="line">126</span><br><span class="line">127</span><br><span class="line">128</span><br><span class="line">129</span><br><span class="line">130</span><br><span class="line">131</span><br><span class="line">132</span><br><span class="line">133</span><br><span class="line">134</span><br><span class="line">135</span><br><span class="line">136</span><br><span class="line">137</span><br><span class="line">138</span><br><span class="line">139</span><br><span class="line">140</span><br><span class="line">141</span><br><span class="line">142</span><br><span class="line">143</span><br><span class="line">144</span><br><span class="line">145</span><br><span class="line">146</span><br><span class="line">147</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="meta-keyword">include</span> <span class="meta-string">"bits/stdc++.h"</span></span></span><br><span class="line"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="built_in">std</span>;</span><br><span class="line"><span class="keyword">const</span> <span class="keyword">int</span> N=<span class="number">2000100</span>;</span><br><span class="line"><span class="meta">#<span class="meta-keyword">define</span> lson id&lt;&lt;1</span></span><br><span class="line"><span class="meta">#<span class="meta-keyword">define</span> rson id&lt;&lt;1|1</span></span><br><span class="line"><span class="function"><span class="keyword">inline</span> <span class="keyword">int</span> <span class="title">read</span><span class="params">()</span></span>&#123;</span><br><span class="line">    <span class="keyword">int</span> c=<span class="number">1</span>,q=<span class="number">0</span>;<span class="keyword">char</span> ch=<span class="string">' '</span>;</span><br><span class="line">    <span class="keyword">while</span>(ch!=<span class="string">'-'</span>&amp;&amp;(ch&lt;<span class="string">'0'</span>||ch&gt;<span class="string">'9'</span>))ch=getchar();</span><br><span class="line">    <span class="keyword">if</span>(ch==<span class="string">'-'</span>)c=<span class="number">-1</span>,ch=getchar();</span><br><span class="line">    <span class="keyword">while</span>(ch&gt;=<span class="string">'0'</span>&amp;&amp;ch&lt;=<span class="string">'9'</span>)q=q*<span class="number">10</span>+ch-<span class="string">'0'</span>,ch=getchar();</span><br><span class="line">    <span class="keyword">return</span> c*q;</span><br><span class="line">&#125;</span><br><span class="line"><span class="class"><span class="keyword">struct</span> <span class="title">node</span>&#123;</span></span><br><span class="line">    <span class="keyword">int</span> u,v,nxt;</span><br><span class="line">&#125;e[N];</span><br><span class="line"><span class="keyword">int</span> head[N];</span><br><span class="line"><span class="keyword">int</span> tot=<span class="number">1</span>;</span><br><span class="line"><span class="class"><span class="keyword">struct</span> <span class="title">Tree</span>&#123;</span></span><br><span class="line">    <span class="keyword">int</span> l,r,c,siz,f;</span><br><span class="line">&#125;t[N];</span><br><span class="line"><span class="keyword">int</span> n,m,root,p,dfn=<span class="number">0</span>,rnk[N],a[N];</span><br><span class="line"><span class="function"><span class="keyword">inline</span> <span class="keyword">void</span> <span class="title">add</span><span class="params">(<span class="keyword">int</span> x,<span class="keyword">int</span> y)</span></span>&#123;</span><br><span class="line">    e[tot].u=x;</span><br><span class="line">    e[tot].v=y;</span><br><span class="line">    e[tot].nxt=head[x];</span><br><span class="line">    head[x]=tot++;</span><br><span class="line">&#125;</span><br><span class="line"><span class="keyword">int</span> dep[N],fa[N],son[N],siz[N],top[N],idx[N];</span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">dfs_1</span><span class="params">(<span class="keyword">int</span> u,<span class="keyword">int</span> f)</span></span>&#123;</span><br><span class="line">    siz[u]=<span class="number">1</span>;</span><br><span class="line">    <span class="keyword">for</span>(<span class="keyword">int</span> i=head[u];i;i=e[i].nxt)&#123;</span><br><span class="line">		<span class="keyword">int</span> v=e[i].v;</span><br><span class="line">        <span class="keyword">if</span>(v==f) <span class="keyword">continue</span>;</span><br><span class="line">		fa[v]=u;</span><br><span class="line">		dep[v]=dep[u]+<span class="number">1</span>;</span><br><span class="line">		dfs_1(v,u);</span><br><span class="line">        siz[u]+=siz[v];</span><br><span class="line">        <span class="keyword">if</span>(siz[v]&gt;siz[son[u]])son[u]=v;</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">update</span><span class="params">(<span class="keyword">int</span> id)</span></span>&#123;</span><br><span class="line">    t[id].c=(t[lson].c+t[rson].c+p)%p;</span><br><span class="line">&#125;</span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">Build</span><span class="params">(<span class="keyword">int</span> id,<span class="keyword">int</span> L,<span class="keyword">int</span> R)</span></span>&#123;</span><br><span class="line">    t[id].l=L;t[id].r=R;t[id].siz=R-L+<span class="number">1</span>;</span><br><span class="line">    <span class="keyword">if</span>(L==R)&#123;</span><br><span class="line">        t[id].c=rnk[L];</span><br><span class="line">        <span class="keyword">return</span>;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="keyword">int</span> mid=(L+R)&gt;&gt;<span class="number">1</span>;</span><br><span class="line">    Build(lson,L,mid);</span><br><span class="line">    Build(rson,mid+<span class="number">1</span>,R);</span><br><span class="line">    update(id);</span><br><span class="line">&#125;</span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">dfs_2</span><span class="params">(<span class="keyword">int</span> u,<span class="keyword">int</span> tp)</span></span>&#123;</span><br><span class="line">    idx[u]=++dfn;</span><br><span class="line">    rnk[dfn]=a[u];</span><br><span class="line">    top[u]=tp;</span><br><span class="line">    <span class="keyword">if</span>(!son[u])<span class="keyword">return</span>;</span><br><span class="line">    dfs_2(son[u],tp);</span><br><span class="line">    <span class="keyword">for</span>(<span class="keyword">int</span> i=head[u];i;i=e[i].nxt)&#123;</span><br><span class="line">        <span class="keyword">if</span>(!idx[e[i].v])&#123;</span><br><span class="line">            dfs_2(e[i].v,e[i].v);</span><br><span class="line">		&#125;</span><br><span class="line">	&#125;</span><br><span class="line">&#125;</span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">pushdown</span><span class="params">(<span class="keyword">int</span> id)</span></span>&#123;</span><br><span class="line">    <span class="keyword">if</span>(!t[id].f) <span class="keyword">return</span> ;</span><br><span class="line">    t[lson].c=(t[lson].c+t[lson].siz*t[id].f)%p;</span><br><span class="line">    t[rson].c=(t[rson].c+t[rson].siz*t[id].f)%p;</span><br><span class="line">    t[lson].f=(t[lson].f+t[id].f)%p;</span><br><span class="line">    t[rson].f=(t[rson].f+t[id].f)%p;</span><br><span class="line">    t[id].f=<span class="number">0</span>;</span><br><span class="line">&#125;</span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">addroute</span><span class="params">(<span class="keyword">int</span> id,<span class="keyword">int</span> L,<span class="keyword">int</span> R,<span class="keyword">int</span> c)</span></span>&#123;</span><br><span class="line">    <span class="keyword">if</span>(L&lt;=t[id].l&amp;&amp;t[id].r&lt;=R)&#123;</span><br><span class="line">        t[id].c+=t[id].siz*c;</span><br><span class="line">        t[id].f+=c;</span><br><span class="line">        <span class="keyword">return</span>;</span><br><span class="line">    &#125;</span><br><span class="line">    pushdown(id);</span><br><span class="line">    <span class="keyword">int</span> mid=(t[id].l+t[id].r)&gt;&gt;<span class="number">1</span>;</span><br><span class="line">    <span class="keyword">if</span>(L&lt;=mid)addroute(lson,L,R,c);</span><br><span class="line">    <span class="keyword">if</span>(R&gt;mid)addroute(rson,L,R,c);</span><br><span class="line">    update(id);</span><br><span class="line">&#125;</span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">addtree</span><span class="params">(<span class="keyword">int</span> x,<span class="keyword">int</span> y,<span class="keyword">int</span> c)</span></span>&#123;</span><br><span class="line">    <span class="keyword">while</span>(top[x]!=top[y])&#123;</span><br><span class="line">        <span class="keyword">if</span>(dep[top[x]]&lt;dep[top[y]])swap(x,y);</span><br><span class="line">        addroute(<span class="number">1</span>,idx[top[x]],idx[x],c);</span><br><span class="line">        x=fa[top[x]];</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="keyword">if</span>(dep[x]&gt;dep[y])swap(x,y);</span><br><span class="line">    addroute(<span class="number">1</span>,idx[x],idx[y],c);</span><br><span class="line">&#125;</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">sumroute</span><span class="params">(<span class="keyword">int</span> id,<span class="keyword">int</span> L,<span class="keyword">int</span> R)</span></span>&#123;</span><br><span class="line">    <span class="keyword">int</span> ans=<span class="number">0</span>;</span><br><span class="line">    <span class="keyword">if</span>(L&lt;=t[id].l&amp;&amp;t[id].r&lt;=R)</span><br><span class="line">        <span class="keyword">return</span> t[id].c;</span><br><span class="line">    pushdown(id);</span><br><span class="line">    <span class="keyword">int</span> mid=(t[id].l+t[id].r)&gt;&gt;<span class="number">1</span>;</span><br><span class="line">    <span class="keyword">if</span>(L&lt;=mid) ans=(ans+sumroute(lson,L,R))%p;</span><br><span class="line">    <span class="keyword">if</span>(R&gt;mid)  ans=(ans+sumroute(rson,L,R))%p;</span><br><span class="line">    <span class="keyword">return</span> ans;</span><br><span class="line">&#125;</span><br><span class="line"><span class="function"><span class="keyword">void</span> <span class="title">treesum</span><span class="params">(<span class="keyword">int</span> x,<span class="keyword">int</span> y)</span></span>&#123;</span><br><span class="line">    <span class="keyword">int</span> ans=<span class="number">0</span>;</span><br><span class="line">    <span class="keyword">while</span>(top[x]!=top[y])&#123;</span><br><span class="line">        <span class="keyword">if</span>(dep[top[x]]&lt;dep[top[y]]) swap(x,y);</span><br><span class="line">        ans=(ans+sumroute(<span class="number">1</span>,idx[top[x]],idx[x]))%p;</span><br><span class="line">        x=fa[top[x]];</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="keyword">if</span>(dep[x]&gt;dep[y]) swap(x,y);</span><br><span class="line">    ans=(ans+sumroute(<span class="number">1</span>,idx[x],idx[y]))%p;</span><br><span class="line">    <span class="built_in">printf</span>(<span class="string">"%d\n"</span>,ans);</span><br><span class="line">&#125;</span><br><span class="line"><span class="function"><span class="keyword">int</span> <span class="title">main</span><span class="params">()</span></span>&#123;</span><br><span class="line">    n=read();m=read();root=read();p=read();</span><br><span class="line">    <span class="keyword">for</span>(<span class="keyword">int</span> i=<span class="number">1</span>;i&lt;=n;i++) a[i]=read();</span><br><span class="line">    <span class="keyword">for</span>(<span class="keyword">int</span> i=<span class="number">1</span>;i&lt;=n<span class="number">-1</span>;i++)&#123;</span><br><span class="line">        <span class="keyword">int</span> x=read(),y=read();</span><br><span class="line">        add(x,y);add(y,x);</span><br><span class="line">    &#125;</span><br><span class="line">    dfs_1(root,root);</span><br><span class="line">    dfs_2(root,root);</span><br><span class="line">    Build(<span class="number">1</span>,<span class="number">1</span>,n);</span><br><span class="line">    <span class="keyword">while</span>(m--)&#123;</span><br><span class="line">        <span class="keyword">int</span> op=read(),x,y,z;</span><br><span class="line">        <span class="keyword">if</span>(op==<span class="number">1</span>)&#123;    </span><br><span class="line">            x=read();y=read();z=read();z=z%p;</span><br><span class="line">            addtree(x,y,z);</span><br><span class="line">        &#125;</span><br><span class="line">        <span class="keyword">else</span> <span class="keyword">if</span>(op==<span class="number">2</span>)&#123;</span><br><span class="line">            x=read();y=read();</span><br><span class="line">            treesum(x,y);</span><br><span class="line">        &#125;</span><br><span class="line">        <span class="keyword">else</span> <span class="keyword">if</span>(op==<span class="number">3</span>)&#123;</span><br><span class="line">            x=read(),z=read();</span><br><span class="line">            addroute(<span class="number">1</span>,idx[x],idx[x]+siz[x]<span class="number">-1</span>,z%p);</span><br><span class="line">        &#125;</span><br><span class="line">        <span class="keyword">else</span> <span class="keyword">if</span>(op==<span class="number">4</span>)&#123;</span><br><span class="line">            x=read();</span><br><span class="line">            <span class="built_in">printf</span>(<span class="string">"%d\n"</span>,sumroute(<span class="number">1</span>,idx[x],idx[x]+siz[x]<span class="number">-1</span>));</span><br><span class="line">        &#125;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
    297. 

  297. <p>完结撒花~~</p>
    298. 

  298. 

  299.     </div>
    300. 

  300. 

  301.     
    302. 

  302.     
    303. 

  303.     
    304. 

  304.         
    305. 

  305. 

  306. <div>
    307. 

  307. <ul class="post-copyright">
    308. 

  308.   <li class="post-copyright-author">
    309. 

  309.     <strong>Post author:  </strong>Alex
    310. 

  310.   </li>
    311. 

  311.   <li class="post-copyright-link">
    312. 

  312.     <strong>Post link: </strong>
    313. 

  313.     <a href="https://schtonn.github.io/posts/tree-link/" title="树链剖分">https://schtonn.github.io/posts/tree-link/</a>
    314. 

  314.   </li>
    315. 

  315.   <li class="post-copyright-license">
    316. 

  316.     <strong>Copyright Notice:  </strong>All articles in this blog are licensed under <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" rel="noopener" target="_blank"><i class="fa fa-fw fa-creative-commons"></i>BY-NC-SA</a> unless stating additionally.
    317. 

  317.   </li>
    318. 

  318. </ul>
    319. 

  319. </div>
    320. 

  320. 

  321. 

  322.       <footer class="post-footer">
    323. 

  323.           
    324. 

  324.           <div class="post-tags">
    325. 

  325.               <a href="/tags/graph/" rel="tag"><i class="fa fa-tag"></i> graph</a>
    326. 

  326.           </div>
    327. 

  327. 

  328.         
    329. 

  329. 

  330. 

  331.         
    332. 

  332.     <div class="post-nav">
    333. 

  333.       <div class="post-nav-item">
    334. 

  334.     <a href="/posts/plan/" rel="prev" title="plan">
    335. 

  335.       <i class="fa fa-chevron-left"></i> plan
    336. 

  336.     </a></div>
    337. 

  337.       <div class="post-nav-item">
    338. 

  338.     <a href="/posts/union-find/" rel="next" title="并查集">
    339. 

  339.       并查集 <i class="fa fa-chevron-right"></i>
    340. 

  340.     </a></div>
    341. 

  341.     </div>
    342. 

  342.       </footer>
    343. 

  343.     
    344. 

  344.   </article>
    345. 

  345.   
    346. 

  346.   
    347. 

  347.   
    348. 

  348. 

  349. 

  350. 

  351.           </div>
    352. 

  352.           
    353. 

  353.     <div class="comments" id="valine-comments"></div>
    354. 

  354. 

  355. <script>
    356. 

  356.   window.addEventListener('tabs:register', () => {
    357. 

  357.     let { activeClass } = CONFIG.comments;
    358. 

  358.     if (CONFIG.comments.storage) {
    359. 

  359.       activeClass = localStorage.getItem('comments_active') || activeClass;
    360. 

  360.     }
    361. 

  361.     if (activeClass) {
    362. 

  362.       let activeTab = document.querySelector(`a[href="#comment-${activeClass}"]`);
    363. 

  363.       if (activeTab) {
    364. 

  364.         activeTab.click();
    365. 

  365.       }
    366. 

  366.     }
    367. 

  367.   });
    368. 

  368.   if (CONFIG.comments.storage) {
    369. 

  369.     window.addEventListener('tabs:click', event => {
    370. 

  370.       if (!event.target.matches('.tabs-comment .tab-content .tab-pane')) return;
    371. 

  371.       let commentClass = event.target.classList[1];
    372. 

  372.       localStorage.setItem('comments_active', commentClass);
    373. 

  373.     });
    374. 

  374.   }
    375. 

  375. </script>
    376. 

  376. 

  377.         </div>
    378. 

  378.           
    379. 

  379.   
    380. 

  380.   <div class="toggle sidebar-toggle">
    381. 

  381.     <span class="toggle-line toggle-line-first"></span>
    382. 

  382.     <span class="toggle-line toggle-line-middle"></span>
    383. 

  383.     <span class="toggle-line toggle-line-last"></span>
    384. 

  384.   </div>
    385. 

  385. 

  386.   <aside class="sidebar">
    387. 

  387.     <div class="sidebar-inner">
    388. 

  388. 

  389.       <ul class="sidebar-nav motion-element">
    390. 

  390.         <li class="sidebar-nav-toc">
    391. 

  391.           Table of Contents
    392. 

  392.         </li>
    393. 

  393.         <li class="sidebar-nav-overview">
    394. 

  394.           Overview
    395. 

  395.         </li>
    396. 

  396.       </ul>
    397. 

  397. 

  398.       <!--noindex-->
    399. 

  399.       <div class="post-toc-wrap sidebar-panel">
    400. 

  400.           <div class="post-toc motion-element"><ol class="nav"><li class="nav-item nav-level-3"><a class="nav-link" href="#前置知识"><span class="nav-number">1.</span> <span class="nav-text"> 前置知识</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#引入"><span class="nav-number">2.</span> <span class="nav-text"> 引入</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#剖分方式"><span class="nav-number">3.</span> <span class="nav-text"> 剖分方式</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#预处理"><span class="nav-number">4.</span> <span class="nav-text"> 预处理</span></a><ol class="nav-child"><li class="nav-item nav-level-4"><a class="nav-link" href="#dfs-no1"><span class="nav-number">4.1.</span> <span class="nav-text"> dfs NO.1</span></a></li><li class="nav-item nav-level-4"><a class="nav-link" href="#dfs-no2"><span class="nav-number">4.2.</span> <span class="nav-text"> dfs NO.2</span></a></li></ol></li><li class="nav-item nav-level-3"><a class="nav-link" href="#维护"><span class="nav-number">5.</span> <span class="nav-text"> 维护</span></a></li><li class="nav-item nav-level-3"><a class="nav-link" href="#完整代码"><span class="nav-number">6.</span> <span class="nav-text"> 完整代码</span></a></li></ol></div>
    401. 

  401.       </div>
    402. 

  402.       <!--/noindex-->
    403. 

  403. 

  404.       <div class="site-overview-wrap sidebar-panel">
    405. 

  405.         <div class="site-author motion-element" itemprop="author" itemscope itemtype="http://schema.org/Person">
    406. 

  406.   <p class="site-author-name" itemprop="name">Alex</p>
    407. 

  407.   <div class="site-description" itemprop="description">The blog of a middle school OIer</div>
    408. 

  408. </div>
    409. 

  409. <div class="site-state-wrap motion-element">
    410. 

  410.   <nav class="site-state">
    411. 

  411.       <div class="site-state-item site-state-posts">
    412. 

  412.           <a href="/archives">
    413. 

  413.           <span class="site-state-item-count">10</span>
    414. 

  414.           <span class="site-state-item-name">posts</span>
    415. 

  415.         </a>
    416. 

  416.       </div>
    417. 

  417.       <div class="site-state-item site-state-tags">
    418. 

  418.             <a href="/tags/">
    419. 

  419.         <span class="site-state-item-count">4</span>
    420. 

  420.         <span class="site-state-item-name">tags</span></a>
    421. 

  421.       </div>
    422. 

  422.   </nav>
    423. 

  423. </div>
    424. 

  424.   <div class="links-of-author motion-element">
    425. 

  425.       <span class="links-of-author-item">
    426. 

  426.         <a href="https://github.com/schtonn" title="GitHub → https:&#x2F;&#x2F;github.com&#x2F;schtonn" rel="noopener" target="_blank"><i class="fa fa-fw fa-github"></i>GitHub</a>
    427. 

  427.       </span>
    428. 

  428.       <span class="links-of-author-item">
    429. 

  429.         <a href="mailto:m18519511495@163.com" title="E-Mail → mailto:m18519511495@163.com" rel="noopener" target="_blank"><i class="fa fa-fw fa-envelope"></i>E-Mail</a>
    430. 

  430.       </span>
    431. 

  431.   </div>
    432. 

  432. 

  433. 

  434.   <div class="links-of-blogroll motion-element">
    435. 

  435.     <div class="links-of-blogroll-title">
    436. 

  436.       <i class="fa fa-fw fa-link"></i>
    437. 

  437.       Links
    438. 

  438.     </div>
    439. 

  439.     <ul class="links-of-blogroll-list">
    440. 

  440.         <li class="links-of-blogroll-item">
    441. 

  441.           <a href="https://yonghong.github.io/" title="https:&#x2F;&#x2F;yonghong.github.io" rel="noopener" target="_blank">Yonghong</a>
    442. 

  442.         </li>
    443. 

  443.         <li class="links-of-blogroll-item">
    444. 

  444.           <a href="https://source.unsplash.com/random/1600x900" title="https:&#x2F;&#x2F;source.unsplash.com&#x2F;random&#x2F;1600x900" rel="noopener" target="_blank">Background</a>
    445. 

  445.         </li>
    446. 

  446.     </ul>
    447. 

  447.   </div>
    448. 

  448. 

  449.       </div>
    450. 

  450. 

  451.       
    452. 

  452.       <div id="treefrog" style="text-align: center;margin-top: 18px;">
    453. 

  453.         <object type="application/x-shockwave-flash" style="outline:none;" data="/flash/treefrog.swf?up_bodyColor=444444&up_pattern=0&up_flyColor=777777&up_tongueColor=555555&up_patternColor=000000&up_releaseFly=0&up_frogName=Froggie&up_backgroundImage=http://&up_bellySize=.5&up_footColor=444444&up_eyeColor=444444&up_backgroundColor=222222&" width="300" height="600"><param name="movie" value="http://cdn.abowman.com/widgets/treefrog/treefrog.swf?up_bodyColor=444444&up_pattern=0&up_flyColor=777777&up_tongueColor=555555&up_patternColor=000000&up_releaseFly=0&up_frogName=Froggie&up_backgroundImage=http://&up_bellySize=.5&up_footColor=444444&up_eyeColor=444444&up_backgroundColor=222222&"></param><param name="AllowScriptAccess" value="always"></param><param name="wmode" value="opaque"></param><param name="scale" value="noscale"/><param name="salign" value="tl"/></object>
    454. 

  454.       </div>
    455. 

  455.       
    456. 

  456. 

  457.     </div>
    458. 

  458.   </aside>
    459. 

  459.   <div id="sidebar-dimmer"></div>
    460. 

  460. 

  461. 

  462.       </div>
    463. 

  463.     </main>
    464. 

  464. 

  465.     <footer class="footer">
    466. 

  466.       <div class="footer-inner">
    467. 

  467.         
    468. 

  468. 

  469.         
    470. 

  470. 

  471. <div class="copyright">
    472. 

  472.   
    473. 

  473.   &copy; 
    474. 

  474.   <span itemprop="copyrightYear">2020</span>
    475. 

  475.   <span class="with-love">
    476. 

  476.     <i class="fa fa-user"></i>
    477. 

  477.   </span>
    478. 

  478.   <span class="author" itemprop="copyrightHolder">Alex Xiang</span>
    479. 

  479. </div>
    480. 

  480. 

  481.         
    482. 

  482. 

  483. 

  484. 

  485. 

  486. 

  487. 

  488. 

  489. 

  490.       </div>
    491. 

  491.     </footer>
    492. 

  492.   </div>
    493. 

  493. 

  494.   
    495. 

  495.   <script src="/lib/anime.min.js"></script>
    496. 

  496.   <script src="//cdn.jsdelivr.net/npm/lozad@1/dist/lozad.min.js"></script>
    497. 

  497.   <script src="/lib/velocity/velocity.min.js"></script>
    498. 

  498.   <script src="/lib/velocity/velocity.ui.min.js"></script>
    499. 

  499. 

  500. <script src="/js/utils.js"></script>
    501. 

  501. 

  502. <script src="/js/motion.js"></script>
    503. 

  503. 

  504. 

  505. <script src="/js/schemes/muse.js"></script>
    506. 

  506. 

  507. 

  508. <script src="/js/next-boot.js"></script>
    509. 

  509. 

  510. 

  511. 

  512. 

  513.   
    514. 

  514. 

  515. 

  516. 

  517. 

  518. 

  519. 

  520. 

  521. 

  522. 

  523. 

  524. 

  525. 

  526. 

  527. 

  528. 

  529.   
    530. 

  530. 

  531.   
    532. 

  532.       
    533. 

  533. <link rel="stylesheet" href="//cdn.jsdelivr.net/npm/katex@0/dist/katex.min.css">
    534. 

  534. 

  535. 

  536.   
    537. 

  537. 

  538. 

  539. <script>
    540. 

  540. NexT.utils.loadComments(document.querySelector('#valine-comments'), () => {
    541. 

  541.   NexT.utils.getScript('//unpkg.com/valine/dist/Valine.min.js', () => {
    542. 

  542.     var GUEST = ['nick', 'mail', 'link'];
    543. 

  543.     var guest = 'nick,mail,link';
    544. 

  544.     guest = guest.split(',').filter(item => {
    545. 

  545.       return GUEST.includes(item);
    546. 

  546.     });
    547. 

  547.     new Valine({
    548. 

  548.       el         : '#valine-comments',
    549. 

  549.       verify     : true,
    550. 

  550.       notify     : true,
    551. 

  551.       appId      : 'BmologYYnRqCv0SLHDeDdA17-gzGzoHsz',
    552. 

  552.       appKey     : 'w9mVebFMdCmY6Nh9vfcBGaGt',
    553. 

  553.       placeholder: "Say something.",
    554. 

  554.       avatar     : 'mm',
    555. 

  555.       meta       : guest,
    556. 

  556.       pageSize   : '10' || 10,
    557. 

  557.       visitor    : true,
    558. 

  558.       lang       : 'en' || 'zh-cn',
    559. 

  559.       path       : location.pathname,
    560. 

  560.       recordIP   : true,
    561. 

  561.       serverURLs : ''
    562. 

  562.     });
    563. 

  563.   }, window.Valine);
    564. 

  564. });
    565. 

  565. </script>
    566. 

  566. 

  567. </body>
    568. 

  568. </html>
    569.