Detail of message

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

请问求最大上升子序列,而且要求能求出具体的子序列来,现在有没有nlogn的算法?

Posted by queyue2004 at 2005-09-27 23:51:02

Followed by:

Re:顶上去. (0) queyue2004 2005-09-28 10:24:44
Re:请问求最大上升子序列,而且要求能求出具体的子序列来,现在有没有nlogn的算法? (3) flymouse 2005-09-28 10:51:45
- 1631就是nlogn的算法,而且很容易就可以在求出最大序列数后直接输出序列来 (7) firefox 2005-09-28 11:27:59
  - 只要求出最长序列的我知道nlogn的算法,但是如果要打印出所有的序列也能有nlogn的? (0) queyue2004 2005-09-28 11:57:03
    - ...同学加个前向数组就行了 (0) semonteer 2005-09-28 12:10:46
    - dp的时候记录的就是第k长度的所有最长序列里面最后一个的最小值,直接从s[1]打印到s[k],好像是这样 (0) firefox 2005-09-28 12:10:56

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator