Introduction - If you have any usage issues, please Google them yourself
procedures for the analysis of algorithms a classic problem, through this procedure, use dynamic programming algorithm to find a website of the longest sequence of ascending sequences of the algorithm and achieving the minimum cost
Packet : 75448186longestseq.rar filelist
LongestSeq\LongestSeq.aps
LongestSeq\LongestSeq.clw
LongestSeq\LongestSeq.cpp
LongestSeq\LongestSeq.dsp
LongestSeq\LongestSeq.dsw
LongestSeq\LongestSeq.h
LongestSeq\LongestSeq.ncb
LongestSeq\LongestSeq.opt
LongestSeq\LongestSeq.plg
LongestSeq\LongestSeq.rc
LongestSeq\LongestSeq.sln
LongestSeq\LongestSeq.suo
LongestSeq\LongestSeq.vcproj
LongestSeq\LongestSeqDoc.cpp
LongestSeq\LongestSeqDoc.h
LongestSeq\LongestSeqView.cpp
LongestSeq\LongestSeqView.h
LongestSeq\MainFrm.cpp
LongestSeq\MainFrm.h
LongestSeq\ReadMe.txt
LongestSeq\res\LongestSeq.ico
LongestSeq\res\LongestSeq.rc2
LongestSeq\res\LongestSeqDoc.ico
LongestSeq\res\Toolbar.bmp
LongestSeq\resource.h
LongestSeq\StdAfx.cpp
LongestSeq\StdAfx.h
LongestSeq\res
LongestSeq