O
(
n
2
)
写
法
O(n^2)写法
O(n2)写法
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#define debug(x) cout<<#x<<" = "<<x<<endl;
#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 100010;
int s[maxn], dp[maxn];
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++) {
dp[i] = 1;
for (int j = 0; j < i; j++)
if (s[j] < s[i])
dp[i] = max(dp[i], dp[j] + 1);
}
int mmax = 0;
for (int i = 0; i < n; i++)
mmax = max(mmax, dp[i]);
cout << mmax << endl;
return 0;
}
O
(
n
l
o
g
n
)
写
法
O(nlog_n)写法
O(nlogn)写法
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
#define debug(x) cout<<#x<<" = "<<x<<endl;
#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 100010;
int s[maxn];
vector<int> vcii;
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
vcii.push_back(s[0]);
for(int i=1;i<n;i++){
if(s[i]>vcii.back())
vcii.push_back(s[i]);
else
*(lower_bound(vcii.begin(),vcii.end(),s[i]))=s[i];
}
cout<<vcii.size()<<endl;
return 0;
}