随机生成一列数字,用字符串保存,求其最大的从小到大的子序列长度
#include<iostream>
#include<algorithm>
#include<ctime>
using namespace std;
#define N 101
int a[N];
int MAX[N];
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
{
a[i] = rand() % 100;
cout<<a[i]<<" ";
MAX[i] = 1;
}
cout << endl;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j < i; j++)
{
if (a[i] > a[j])
{
MAX[i] = max(MAX[i], MAX[j] + 1);
}
}
}
cout << *max_element(MAX + 1, MAX + n+1);
return 0;
}