堆
Coco_T_
东南大学本科毕业生,浙江大学在读研究生
展开
-
Heidi and Library (medium)
Whereas humans nowadays read fewer and fewer books on paper, book readership among marmots has surged. Heidi has expanded the library and is now serving longer request sequences.Input Same as the easy原创 2017-06-04 16:22:38 · 497 阅读 · 0 评论 -
bzoj2006 [NOI2010]超级钢琴(ST表+优先队列)
题目链接 分析: 显然,最后的答案是从大到小排名前k的和弦之和 我们先考虑如何求出最大值 我一开始认为这就是最大子段和的问题,dp即可:f[i]=max(f[i−1]+a[i],a[i])f[i]=max(f[i−1]+a[i],a[i])f[i]=max(f[i-1]+a[i],a[i]) 但是我们对于和弦有长度要求 因此,我们先就是计算出前缀和sumsumsum, 之后枚举和弦的...原创 2018-03-03 17:02:32 · 398 阅读 · 0 评论