树形结构+dp思维 Codeforces Round #247 (Div. 2) C题 k-Tree_quite recently a creative student lesha had a lect-CSDN博客

本文链接：https://blog.csdn.net/qq_44291254/article/details/106862613

博客探讨了Lesha创造的k-Tree概念，这是一种特殊性质的无限根树。Dima想知道在k-Tree中，从根节点出发，权值总和为n且至少有一条边权重大于等于d的路径数量。问题可以通过动态规划解决，计算路径数量的dp1和dp2数组，最终答案为dp1[n]-dp2[n]，模10^9+7。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

k-Tree

Quite recently a creative student Lesha had a lecture on trees. After the lecture Lesha was inspired and came up with the tree of his own which he called a k-tree.

A k-tree is an infinite rooted tree where:

· each vertex has exactly k children;
· each edge has some weight;
· if we look at the edges that goes from some vertex to its children (exactly k edges), then their weights will equal 1, 2, 3, …, k.

The picture below shows a part of a 3-tree.
在这里插入图片描述
As soon as Dima, a good friend of Lesha, found out about the tree, he immediately wondered: “How many paths of total weight n (the sum of all weights of the edges in the path) are there, starting from the root of a k-tree and also containing at least one edge of weight at least d?”.