- emm LIS的模版题吧,但是我太鶸了还是理解了好久才能写出来
还有可以 O(nlogn)的 - - 但是…尚未掌握
A numeric sequence of ai is ordered if a1 < a2 < … < aN. Let the subsequence of the given numeric sequence ( a1, a2, …, aN) be any sequence ( ai1, ai2, …, aiK), where 1 <= i1 < i2 < … < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
Your program, when given the numeric sequence, must find the length of its longest ordered subsequence.
Input
The first line of input file contains the length of sequence N. The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated by spaces. 1 <= N <= 1000Output
Output file must contain a single integer - the length of the longest ordered subsequence of the given sequence.Sample Input
7
1 7 3 5 9 4 8Sample Output
4
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int N;
int a[1005];
int dp[1005];
void solve(){
int res = 0;
for(int i = 0;i < N;i++){
dp[i] = 1;
for(int j = 0;j < i;j++){
if(a[j] < a[i]){
dp[i] = max(dp[i] , dp[j] + 1);
}
}
res = max(res,dp[i]);
}
cout<<res<<endl;
}
int main(){
while(~scanf("%d",&N)){
for(int i = 0;i < N;i++){
scanf("%d",&a[i]);
}
solve();
}
return 0;
}