#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<string>
#include<iomanip>
#include<vector>
#include<fstream>
#include<algorithm>
using namespace std;
typedef long long ll; int b[100001];
int s[1000001];
int main()
{
memset(s, 0, sizeof s);
int n; cin >> n;
int a;
for (int i = 1; i <= n; i++)
{
cin >> b[i];
}
for (int i = 1; i <= n; i++)
{
s[i] =1 ;
for (int j = 1; j < i; j++)
{
if (b[i] > b[j])
{
s[i] = max(s[i], s[j] + 1);
}
}
}
int maxx = -1;
for (int i = 1; i <= n; i++)
{
maxx = max(maxx, s[i]);
}
cout <<maxx << endl;
}
08-16
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交