5.1 最长递增子序列 Using the dynamic programming method i

Title: 5.1 最长递增子序列

Category:
Data structs
Tags:
[C/C++]
File Size:
6kb
Update:
2018-03-24
Downloads:
0 Times
Uploaded by:
Alionness

Description: Using the dynamic programming method in c++ language to find the longest incrementing subsequence of a sequence

Downloaders recently: [More information of uploader Alionness]

To Search:

File list (Check if you may need any files):

Filename Size Date
5.1 最长递增子序列  0  2011-04-06
5.1 最长递增子序列\main.cpp  2548  2011-04-06
5.1 最长递增子序列\最长递增子序列.dsp  4370  2011-04-06
5.1 最长递增子序列\最长递增子序列.dsw  536  2011-04-06
5.1 最长递增子序列\最长递增子序列.ncb  41984  2011-04-06
5.1 最长递增子序列\最长递增子序列.opt  48640  2011-04-06
5.1 最长递增子序列\最长递增子序列.plg  1336  2011-04-06

Filename	Size	Date
5.1 最长递增子序列	0	2011-04-06
5.1 最长递增子序列\main.cpp	2548	2011-04-06
5.1 最长递增子序列\最长递增子序列.dsp	4370	2011-04-06
5.1 最长递增子序列\最长递增子序列.dsw	536	2011-04-06
5.1 最长递增子序列\最长递增子序列.ncb	41984	2011-04-06
5.1 最长递增子序列\最长递增子序列.opt	48640	2011-04-06
5.1 最长递增子序列\最长递增子序列.plg	1336	2011-04-06