bzoj 1669: [Usaco2006 Oct]Hungry Cows饥饿的奶牛 暴力

#include<iostream>
#include<cstdio>
#include<queue>
#include<vector>
#include<algorithm>
#include<cstring>

#define inf 999999999
#define ll long long

using namespace std;

int n;
int a[5050];
int dp[5050];
int ans=0;

int main(){
scanf("%d",&n);
for(int i=1; i<=n; i++){
scanf("%d",&a[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;
}