来源:POJ2533
水题DP,从头学起
代码:
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
//DP
int n;
const int MAXN = 1010;
int dp[MAXN];
int a[MAXN];
int main(){
while(scanf("%d",&n)!=EOF){
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;i++){
scanf("%d",a+i);
dp[i] = 1;
}
for(int i=2;i<=n;i++){
for(int j=1;j<i;j++){
if(a[i]>a[j]){
dp[i] = max(dp[i],dp[j]+1);
}
}
}
int ans = -1;
for(int i=1;i<=n;i++) ans = max(ans,dp[i]);
cout<<ans<<endl;
}
return 0;
}