动态规划求最长上升子序列两种算法
一、
O
(
N
2
)
{O(N^2)}
O(N2)算法
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin >> n){
int v[n+1];
for(int i = 1; i <= n; i++){
cin >> v[i];
}
int dp[n+1];
for(int i = 0; i <= n; i++){
dp[i] = 1;
}
for(int i = 1; i <= n; i++){
for(int j = 1; j < i; j++){
if(v[j] <= v[i])
dp[i] = max(dp[i], dp[j]+1);
}
}
sort(dp+1, dp+n+1);
cout << dp[n] << endl;
}
return 0;
}
二、
O
(
N
l
o
g
(
N
)
)
{O(Nlog(N))}
O(Nlog(N))算法
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin >> n){
int a[n+1];
for(int i = 1; i <= n; i++){
cin >>a[i];
}
vector<int>v;
v.push_back(a[1]);
for(int i = 2; i <= n; i++){
if(a[i] < *v.rbegin()){
auto pos = lower_bound(v.begin(), v.end(), a[i]);
*pos = a[i];
}else{
v.push_back(a[i]);
}
}
cout << v.size() << endl;
}
return 0;
}