BuringStraw
Follow
0
Followers
0
Followings
Patron
Home
Archives
点分治
Latest
Hottest
Most Commented
点分治
听大佬说淀粉质可好吃了然后去做题的我 作用 用来求树上的路径问题 比如求有多少个点之间的路径长度为 k 之类的。 步骤 首先求重心,以保证这棵树的层数较少,防止 TLE Copy void getG(int p, int fa) { treeSize[p] =…
点分治
2 min
6 years ago
Ownership of this blog data is guaranteed by blockchain and smart contracts to the creator alone.
Blockchain ID
#71711
Owner
0x9c85eabbe4734f056ab38a8e8bd6935334113658
Transaction Hash
Creation 0x25ae358b...e0eca3eca7
Last Update 0x25ae358b...e0eca3eca7
IPFS Address
ipfs://QmPnMnSkUZtzztwtPhxDLfCWUNb4nv9LscnteZyv1apPx5