 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
Re:动态规划，最长下降子序列问题In Reply To:动态规划，最长下降子序列问题 Posted by:ACMore_txj at 2014-04-21 22:42:52 这个最长下降子序列算法可以把复杂度降到nlogn的 最少的上升子序列个数等于最长下降子序列长度 同样的,最少的下降子序列个数等于最长上升子序列的长度. 这是为什么呢? 我是寻找上升子序列最小的个数的 虽说复杂度也是nlogn 但是感觉不如寻找最长下降子序列的思路好 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
