题目链接
题解思路
和最长上升子序列的思路一样 改动的是去求和最大的解
通过代码
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 1010;
int n, res;
int a[N], f[N];
int main()
{
cin >> n;
for (int i = 1; i <= n; i ++ ) cin >> a[i];
for (int i = 1; i <= n; i ++ )
{
f[i] = a[i];
for (int j = 1; j < i; j ++ )
if (a[j] < a[i]) f[i] = max(f[i], a[i] + f[j]);
res = max(res, f[i]);
}
cout << res << endl;
return 0;
}