随笔分类 - 树上乱搞---树链剖分
摘要：这几天睡眠时间都不太够，室友晚上太会折腾了，感觉有点累，所以昨天的题解也没写，看晚上能不能补起来。 B . Marbles 题意：给定N组数(xi,yi)，玩家轮流操作，每次玩家可以选择其中一组对其操作，可以把它减去一个数，或同时减去一个数，当玩家操作后出现了（0，0）则胜利。 思路：注意这里是出现
阅读全文
摘要：2243: [SDOI2011]染色 Description 给定一棵有n个节点的无根树和m个操作，操作有2类： 1、将节点a到节点b路径上所有点都染成颜色c； 2、询问节点a到节点b路径上的颜色段数量（连续相同颜色被认为是同一段）， 如“112221”由3段组成：“11”、“222”和“1”。 请
阅读全文
摘要：Description 给出一个n个节点的有根树（编号为0到n-1，根节点为0）。一个点的深度定义为这个节点到根的距离+1。设dep[i]表示点i的深度，LCA(i,j)表示i与j的最近公共祖先。有q次询问，每次询问给出l r z，求sigma_{l<=i<=r}dep[LCA(i,z)]。（即，求
阅读全文
摘要：关键词：并查集，二分图，树剖，树上差分，LCA，搜索。 例题一： CodeForces-85E：Guard Towers 题意：给定平面上N个点(N<=5000)，以及N个点的坐标。现在可以把每个点染成红色或者蓝色。求最小化同色点的最大距离，且求出相应的方案数。 思路：二分答案L，把距离大于等于L的
阅读全文
摘要：Yixght is a manager of the company called SzqNetwork(SN). Now she's very worried because she has just received a bad news which denotes that DxtNetwor
阅读全文
摘要：You are given a tree with N nodes. The tree’s nodes are numbered 1 through N and its edges are numbered 1 through N − 1. Each edge is associated with
阅读全文
摘要：After their royal wedding, Jiajia and Wind hid away in XX Village, to enjoy their ordinary happy life. People in XX Village lived in beautiful huts. T
阅读全文
摘要：You are given a tree (an undirected acyclic connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. Each edge has an integer value assigned t
阅读全文
摘要：You are given a node-labeled rooted tree with n nodes. Define the query (x, k): Find the node whose label is k-th largest in the subtree of the node x
阅读全文
摘要：ιYou are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. We will ask you to perfrom some instruct
阅读全文
