HBC223857[NOI1999]钉子和小球,线性dp,动态规划DescentofDragons题解 There are n{n}n dragons in a row, indexed 1 through n{n}n. Every dragon has a level, and initially,... 算法基础篇 2023-11-16 56 #HBC223857[NOI1999]钉子和小球 #线性dp #动态规划DescentofDragons题解
![HBC223857[NOI1999]钉子和小球,线性dp,动态规划DescentofDragons题解](https://www.xxstcz.com/zb_users/cache/thumbs/ca9c5d4151fa780a7391aacb4be158dd-320-200-1.jpeg "HBC223857[NOI1999]钉子和小球,线性dp,动态规划DescentofDragons题解")