HDU-6609 Find the answer (权值线段树)
题目:
Given a sequence of n integers called W and an integer m. For each i (1 <= i <= n), you can choose some elementsWkWk(1 <= k < i), and change them to zero to make∑ij=1∑j=1i...
原创
2019-07-31 09:17:04 ·
292 阅读 ·
0 评论