随笔分类 -  子序列

 
2017ICPC南宁赛区网络赛 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 rul 阅读全文
posted @ 2017-09-25 20:45 Annetree 阅读(266) 评论(0) 推荐(0)