TYVJ 1049 最长不下降子序列 by C++

入门DP，直接贴代码

#include<iostream>
#include<string.h>
using namespace std;

int n,ans=0;
const int maxn=5000;
int f[maxn],a[maxn];

void get_input()
{
    memset(f,0,sizeof(f));
    memset(a,0,sizeof(a));
    cin >> n;
    for (int i=1;i<=n;i++) cin >> a[i];
}

void get_answer()
{
    for (int i=n-1;i>0;i--){
        for (int j=i+1;j<=n;j++){
            if (a[j]>=a[i] && f[j]+1>f[i]) f[i]=f[j]+1;
        }
    }
    for (int i=1;i<=n;i++) if (f[i]>ans) ans=f[i];
}

int main()
{
    get_input();
    get_answer();
    cout << ++ans << endl;
}