[問題] 串列整數問題
輸入為一串整數數列,請從中找到一個長度最長的遞增子串列並輸出,
選取其中和最大的子串列。例如:當輸入串列為1、7、6、5、8、9、2 時,
輸出為1、8、9
小弟我是想說(1,7),(6,5)這樣step by step解
最後在合併找出遞增序列輸出,但是好像不是這麼單純,
有人肯賜教幫忙這種題目要如何解決嗎??
感謝!!
--
◢ ◣ ▊ ▊ ▊ ▊ ◢◣ ◢◣ ▊ ▊ ▊███ ◣ ◣
◢█ L I N ◣ ▊ ▊ █◣ ▊◢ ◥◣ ▊ ▊ █◣ ▊ ▊ ▊ ▊ ▊
◥◤ ▊ ▇▇ ◥◤ ▊ ▊ ▊◥◣▊◥ ▊ ▊▊◥◣▊ ▊ ▊ ▊ ▊
▊ ▊▎ ▊ ▊ ▊ ◥▊ ◥◣ ▊ ▊▊ ◥▊ ▊ ▊ ▉ ▉
▊ ▎ ▊ ▊ ▊ ▊ ◥◣█▆▆▊▊ ▊ ▊ ▊ ◥█ ◤
ψ █▇▇ ▊ ▊ ▊◣▅▇◤▊ ▊▊ ▊ ▊ ▊ ▊
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 114.27.125.244
※ 文章網址: http://www.ptt.cc/bbs/java/M.1413636048.A.6BB.html
推
10/18 20:44, , 1F
10/18 20:44, 1F
→
10/18 22:40, , 2F
10/18 22:40, 2F
推
10/19 17:24, , 3F
10/19 17:24, 3F
→
10/19 19:24, , 4F
10/19 19:24, 4F
→
10/19 19:24, , 5F
10/19 19:24, 5F
→
10/19 19:25, , 6F
10/19 19:25, 6F
→
10/19 19:25, , 7F
10/19 19:25, 7F
→
10/19 19:25, , 8F
10/19 19:25, 8F
→
10/19 22:39, , 9F
10/19 22:39, 9F
→
10/19 23:34, , 10F
10/19 23:34, 10F
→
10/20 09:15, , 11F
10/20 09:15, 11F
→
10/20 11:43, , 12F
10/20 11:43, 12F
推
10/20 13:10, , 13F
10/20 13:10, 13F
→
10/20 13:10, , 14F
10/20 13:10, 14F
→
10/20 13:11, , 15F
10/20 13:11, 15F
→
10/20 13:11, , 16F
10/20 13:11, 16F
→
10/20 13:11, , 17F
10/20 13:11, 17F
→
10/20 13:12, , 18F
10/20 13:12, 18F
→
10/20 13:12, , 19F
10/20 13:12, 19F
→
10/20 13:14, , 20F
10/20 13:14, 20F
→
10/20 13:32, , 21F
10/20 13:32, 21F
→
10/20 13:37, , 22F
10/20 13:37, 22F
→
10/20 13:38, , 23F
10/20 13:38, 23F
推
10/20 20:47, , 24F
10/20 20:47, 24F
→
10/20 20:47, , 25F
10/20 20:47, 25F
→
10/20 20:47, , 26F
10/20 20:47, 26F
→
10/20 20:48, , 27F
10/20 20:48, 27F