Description: Seeking the longest monotonically increasing subsequence. For example: The original array: 1 5 1,315,621,686,216,522,159 62 1 3 5,631,156,311,663,166,316 6 1 Results: the longest monotonically increasing sub- sequence: Length: 14 Content: 1 1 1 1 1 1 1 1 1 1 6 6 6 6
File list (Check if you may need any files):
LongestIncSubSeq\Function.cpp
................\Functions.h
................\LongestIncSubSeq.aps
................\LongestIncSubSeq.clw
................\LongestIncSubSeq.cpp
................\LongestIncSubSeq.dsp
................\LongestIncSubSeq.dsw
................\LongestIncSubSeq.h
................\LongestIncSubSeq.ncb
................\LongestIncSubSeq.opt
................\LongestIncSubSeq.plg
................\LongestIncSubSeq.rc
................\LongestIncSubSeqDlg.cpp
................\LongestIncSubSeqDlg.h
................\Longest_Mono_Incr_Subseq.cpp
................\Longest_Mono_Incr_Subseq.h
................\ReadMe.txt
................\..lease\Function.obj
................\.......\LongestIncSubSeq.exe
................\.......\LongestIncSubSeq.obj
................\.......\LongestIncSubSeq.res
................\.......\LongestIncSubSeqDlg.obj
................\.......\Longest_Mono_Incr_Subseq.obj
................\.......\StdAfx.obj
................\res\LongestIncSubSeq.ico
................\...\LongestIncSubSeq.rc2
................\Resource.h
................\StdAfx.cpp
................\StdAfx.h
................\sub_sequence_main.cpp
................\Release
................\res
LongestIncSubSeq
Download