题解 | #最大上升子序列和#

首先确保是上升序列，然后再确保转移的时候往最终权重大的转

#include <iostream>
#include <algorithm>
using namespace std;

const int N = 1e3 + 10;

int a[N], f[N];
int n;

int main()
{
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> a[i], f[i] = a[i];
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j < i; ++j)
            if (a[j] < a[i])
                    f[i] = max(f[i], f[j] + a[i]);
    }
    int res = 0;
    for (int i = 1; i <= n; ++i)
        res = max(f[i], res);
    cout << res << endl;
    return 0;
}