权值线段树
bootdubbo
这个作者很懒,什么都没留下…
展开
-
Find the answer
Problem DescriptionGiven a sequence of n integers called W and an integer m. For each i (1 <= i <= n), you can choose some elements Wk (1 <= k < i), and change them to zero to make ∑ij=1W...原创 2019-08-24 12:55:19 · 180 阅读 · 0 评论 -
Distribution of books【二分+DP+权值线段树】
Problem Descriptionzz6d likes reading very much, so he bought a lot of books. One day, zz6d brought n books to a classroom in school. The books of zz6d is so popular that K students in the classroom ...原创 2019-08-27 00:56:09 · 209 阅读 · 0 评论