**要看样例点的加我团队**[https://www.luogu.com.cn/team/78057](https://www.luogu.com.cn/team/78057)，我把测试点信息放在“文件”里了
by 3Luby3 @ 2024-04-27 16:51:23
这是代码
```cpp
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
int a[1001],dp[1001];
for(int i = 0; i < N; i++) {
cin >> a[i];
}
for(int i = 0; i < N; i++) {
dp[i] = a[i];
for(int j = 0; j < i; j++) {
if(a[i] > a[j]) {
dp[i] = max(dp[i], dp[j] + a[i]);
}
}
}
int maxn = dp[0];
for(int i = 1; i < N; i++) {
if(dp[i] > maxn) {
maxn = dp[i];
}
}
if(maxn>0) cout << maxn;
else cout<<-1;
return 0;
}
```
by 3Luby3 @ 2024-04-27 16:52:03