Dust_heart的博客

Distance QueriesTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 11677 Accepted: 4124Case Time Limit: 1000MSDescriptionFa

POJ 3728 The merchantThere are N cities in a country, and there is one and only one simple path between each pair of cities. A merchant has chosensome paths and wants to earn as much money as possible in each path. When hemove along a path, he can choo

最近公共祖先（LCA）首先来介绍下最近公共祖先（LCA）的概念百度上的解释：对于有根树T的两个结点u、v，最近公共祖先LCA(T,u,v)表示一个结点x，满足x是u、v的祖先且x的深度尽可能大。通俗语言：在一棵没有环的树上，每个节点肯定有其父亲节点和祖先节点，而最近公共祖先节点，就是两个节点在这棵树上深度最大的公共的祖先节点，即两个点在这棵树上距离最近的公共祖先节点

POJ 1330 Nearest Common Ancestors 【Tarjan+倍增+RMQ】A rooted tree is a well-knowndata structure in computer science and engineering. An example is shown below:、In the figure, each node is labeled with an integer from {1, 2,...,16}. Node 8is the root of th

DFS 序3，树上差分1Time Limit: 2000 MS Memory Limit: 131072 K Problem Description这是一道模板题。给一棵有根树，这棵树由编号为1…N的N个结点组成。根结点的编号为 R。每个结点都有一个权值，结点i的权值为vi。 接下来有M组操作，操作分为两类：1 a b x，表示将「结点a到结点b的简单路径」上所有结点的权值都增加x...