chy2003的博客

原题SaMer has written the greatest test case of all time for one of his problems. For a given array of integers, the problem asks to find the minimum number of groups the array can be divided into, su...

原题Andrew skipped lessons on the subject ‘Algorithms and Data Structures’ for the entire term. When he came to the final test, the teacher decided to give him a difficult task as a punishment.The t...

原题链接题目大意给定一棵根为１，初始时所有节点值为０的树，进行以下三个操作： *将以某点为根的子树节点值都变为１ *将某个节点及其祖先的值都变为０ *询问某个节点的值解题思路这是一道裸的树链剖分题。下面详细地介绍一下树链剖分。树链剖分预备知识：线段树、DFS序树链剖分想法｜起源首先，如果一棵树退化成一条链，那么它会有非常好的性质...