善良钢笔

文章
2
资源
1
加入时间
3年0月9天

The Heaviest Non-decreasing Subsequence Problem

Let SSS be a sequence of integers s1s_{1}s​1​​, s2s_{2}s​2​​, ………, sns_{n}s​n​​ Each integer is is associated with a weight by the following rules:(1) If is is negative, then its weight is 000.(2) If i