heaviest专题

ACM-ICPC 2017 南宁赛区网络预赛 L The Heaviest Non-decreasing Subsequence Problem 【最长非递减子序列的变形】

1000ms 131072K Let S be a sequence of integers s1​, s2​, ......, sn​ Each integer is associated with a weight by the following rules: (1) If is negative, then its weight is 0. (2) If is greater th