Sample Input
8 389 207 155 300 299 170 158 65Sample Output
2
没看题解前,我的思路和这位博主的思路几乎一样,但越写越复杂,总觉得不对劲,只好看一眼题解,发现居然是LIS!
不看题解的话,还真是想不出来,先写下来慢慢悟吧
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <bitset>
using namespace std;
#define LL long long
#define ZERO(a) memset(a,0,sizeof(a))
const LL INF = 0x3f3f3f3f;
const int mod = 1e9+7;
const int maxn = 3e4+10;
int a[maxn];
int dp[maxn];
int main()
{
int n;
while(~scanf("%d",&n)){
for(int i=1; i<=n; ++i) scanf("%d",&a[i]);
ZERO(dp);
int ans = 0;
for(int i=1; i<=n; ++i){
dp[i] = 1;
for(int j=1; j<i; ++j){
if(a[j] < a[i]){
dp[i] = max(dp[i], dp[j]+1);
}
}
ans = max(ans, dp[i]);
}
printf("%d\n",ans);
}
return 0;
}