题解 | #最大上升子序列和#
最大上升子序列和
https://www.nowcoder.com/practice/dcb97b18715141599b64dbdb8cdea3bd
#include<iostream>
#include<climits>
using namespace std;
int arr[1005];
int dp[1010] = { 0 };
int main() {
int n;
while (cin >> n) {
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int answer = 0;
for (int i = 0; i < n; i++) {
dp[i] = arr[i];
for (int j = 0; j < i; ++j) {
if (arr[j] < arr[i])
dp[i] = max(dp[i], dp[j] + arr[i]);
}
answer = max(answer, dp[i]);
}
cout << answer << endl;
}
}
查看2道真题和解析
投递网易互娱等公司10个岗位 >