题目描述
blablabla
样例
#include<iostream>
#include<algorithm>
using namespace std;
const int MAX = 10000;
int dp[MAX];
int src[MAX];
int n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> src[i];
int flag = -100;
dp[1] = 1;
for (int i = 2; i <= n; i++)
{
for (int j = 1; j < i; j++)
if (src[j] < src[i])
flag = max(flag, dp[j]);
if (flag < 0)
dp[i] = 1;
else
dp[i] = flag + 1;
flag = -100;
}
int temp = 0;
for (int i = 1; i <= n; i++)
{
temp = max(temp, dp[i]);
}
cout << temp << endl;
system("pause");
return 0;
}
算法1
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla
算法2
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla