最长递增子序列(编程之美2.16)

int longestIncreaseSubSerial(int* array, int length) {
if (NULL == array || 0 >= length) {
return -1;
}

//初始化各个子序列的最大长度
int* currentMax = new int[length];
for (int i = 0; i < length; ++i) {
currentMax[i] = 1;
}

for (int i = 0; i < length; ++i) {
for (int j = 0; j < i; ++j) {
if (array[j] < array[i]) {
//递归关系式——如果a[k+1]>a[i],longest[k+1]=max{longest[i]}+1(i=0,1,...,k),否则其等于1.
currentMax[i] = std::max(currentMax[j] + 1, currentMax[i]);
}
}
}

int longest = 0;
for (int i = 0; i < length; ++i) {
longest = std::max(longest, currentMax[i]);
}

delete currentMax;

return longest;
}

/*
* longestCommomSerialMain.cpp
*
*  Created on: 2014-4-11 14:40:08
*      Author: danDingCongRong
*/

#include<iostream>
using namespace std;

//输入各个数组元素
void inputArray(int* array, int length) {
cout << "输入这个数组中的各个数字：" << endl;
for (int i = 0; i < length; ++i) {
cin >> array[i];
}
}

int main() {
int length = 0;
cout << "请输入数组的长度：" << endl;
while (cin >> length) {
int* x = new int[length];
inputArray(x, length);

cout << "longest=" << longestIncreaseSubSerial(x, length) << endl;

delete x;

cout << "请输入数组的长度：" << endl;
}

return 0;
}