## P2015 binary apple tree (tree DP)

Title Link: Binary apple tree - Luogu
Analysis: This is a tree DP topic. It's not too difficult, but it's easy to grasp the details. Let's explain this topic directly below:
Let f[i][j] represent the maximum number of apples that can be retained by retaining j branches in the subtree with I as the root. After knowing the state representatio ...

Posted by **lobski** on *Sat, 26 Feb 2022 04:14:55 +0100*

## [Simulation Competition] infection (point division, strong connected component reduction point)

background
One day, a group of dogs suddenly began to moisten people in the past, so the students banned this part of the science and technology building.
~
Deadcodes: old machine room
Problem surface
Your country
...

Posted by **Janjan** on *Thu, 10 Feb 2022 21:07:32 +0100*

## C language data structure (Zhu Zhanli): tree

Data structures: trees
1, Tree
1. Definition of tree
A set composed of N nodes, n=0 is called an empty tree, and a tree with n=1 has only one node. For a tree with n > 1, T has:
The top node is called the root node, and the root node has no precursor nodeExcept for the root node, the other nodes are divided into m disjoint sets, and each ...

Posted by **buddymoore** on *Sat, 22 Jan 2022 09:31:54 +0100*

## antd Tree tree control - after incomplete selection of child nodes, you want to obtain the value of the parent node and interact with the back end

Recently, there is a requirement for a permission tree, and the structure of the tree is relatively deep. If you want to implement it, you can obtain the value of the parent node and pass it to the back end after incomplete selection of the child node.
After incomplete sub node selection, you want to obtain the value of the parent node
As sho ...

Posted by **jcarver** on *Mon, 27 Dec 2021 11:45:01 +0100*

## [improvement group training 2021] Round2

I'm too lazy to talk nonsense. I'm a fool.
C
Title Description
Given a tree with \ (n \) points, record \ (L(u,v) \) as the number of points on the \ ((u,v) \) simple path. For the path \ ((a,b),(c,d) \) point disjoint Quad \ ((a,b,c,d) \), we want to know how many different values \ ((L(a,b),L(c,d)) \) have.
\(n\leq 5\cdot 10^5\)
solution
The ...

Posted by **gigabyt3r** on *Fri, 12 Nov 2021 03:07:43 +0100*