机器写的《插头dp》

#include <iostream>
#include <cstring>

using namespace std;

const int N = 1010;

int n;
int a[N];
int dp[N];

int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }

    memset(dp, 0, sizeof dp);
    for (int i = 1; i <= n; i++)
    {
        dp[i] = 1; // 初始化为 1，表示自身可以构成长度为 1 的序列
        for (int j = 1; j < i; j++)
        {
            if (a[i] > a[j])
            {
                dp[i] = max(dp[i], dp[j] + 1);
            }
        }
    }

    int res = 0;
    for (int i = 1; i <= n; i++)
    {
        res = max(res, dp[i]);
    }
    cout << res << endl;

    return 0;
}