王小二的博客

Problem Description There is a company that has N employees(numbered from 1 to N),every employee in the company has a immediate boss (except for the leader of whole company).If you are the immediat

Problem Description You are given a tree, it’s root is p, and the node is numbered from 1 to n. Now define f(i) as the number of nodes whose number is less than i in all the succeeding nodes of nod

Apple Tree Description There is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the

The New Year holidays are over, but Resha doesn’t want to throw away the New Year tree. He invited his best friends Kerim and Gural to help him to redecorate the New Year tree. The New Year tree is

树通常有多种类型，但其终归是非线性结构，操作起来有时总是那么费时。 例如：POJ 3321 给你一棵树，树上每个节点都有1个苹果，然后你对一个节点操作，如果有苹果就拿走，没苹果就放上，然后询问你以x为根的子树上共有多少个苹果。 每次更新都要遍历一遍，查询也要遍历一遍，时间复杂度很高。如果能转化成线性结构就可以了，就可以用线段树或者树状数组等其他方法对树高效更新和查询。 DFS序就是将树

The Bottom of a Graph Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 11623 Accepted: 4784 Description We will use the following (standard) definitions from graph theory. Le...