Description: Designed an algorithm to find all of the LCS, the worst-case analysis. Use " accounting methods" to prove the use of b [i, j] to seek all the LCS algorithm in the worst case time complexity is O ().
To Search:
File list (Check if you may need any files):
All_Lcs\All_Lcs\All_Lcs.sln
.......\.......\All_Lcs.suo
.......\.......\Debug\All_Lcs.exe
.......\.......\.....\All_Lcs.ilk
.......\.......\.....\All_Lcs.pdb
.......\.......\All_Lcs\All_Lcs.vcproj
.......\.......\.......\All_Lcs.vcproj.PC-200912082359.Administrator.user
.......\.......\.......\ReadMe.txt
.......\.......\.......\stdafx.cpp
.......\.......\.......\stdafx.h
.......\.......\.......\targetver.h
.......\.......\.......\Debug\All_Lcs.exe.embed.manifest
.......\.......\.......\.....\All_Lcs.exe.embed.manifest.res
.......\.......\.......\.....\All_Lcs.exe.intermediate.manifest
.......\.......\.......\.....\All_Lcs.obj
.......\.......\.......\.....\All_Lcs.pch
.......\.......\.......\.....\BuildLog.htm
.......\.......\.......\.....\mt.dep
.......\.......\.......\.....\stdafx.obj
.......\.......\.......\.....\vc90.idb
.......\.......\.......\.....\vc90.pdb
.......\.......\.......\All_Lcs.vcproj.牛传正.Administrator.user
.......\.......\.......\All_Lcs.cpp
.......\.......\All_Lcs.ncb
.......\算法设计说明.doc
.......\All_Lcs\All_Lcs\Debug
.......\.......\Debug
.......\.......\All_Lcs
.......\All_Lcs
All_Lcs
Download