算法
- 状态表示：\(f[i]\)
集合：所有以 \(a[i]\) 结尾的上升子序列
属性：和的最大值 - 状态计算：集合的划分
类比LIS
代码
#include <iostream>
using namespace std;
const int N = 1010;
int n;
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[i] > a[j]) {
f[i] = max(f[i], f[j] + a[i]);
}
}
}
int ans = 0;
for (int i = 1; i <= n; ++i) ans = max(ans, f[i]);
cout << ans << endl;
return 0;
}