This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
const int maxn = 1e5 + 2;
int64 dp [maxn][2];
int64 p [maxn];
int64 max_weights(int n, int m, vector<int> x, vector<int> y,
vector<int> w) {
for (int i = 0; i < m; i++) {
p[x[i] + 1] = w[i];
}
dp[1][0] = 0;
dp[1][1] = p[2];
dp[2][0] = p[2];
dp[2][1] = p[1] + p[3];
for (int i = 3; i <= n; i++){
dp[i][0] = max(dp[i-1][1], dp[i-1][0]);
dp[i][1] = max({dp[i-2][0] + p[i-1] + p[i+1], dp[i-2][1] + p[i + 1], dp[i-1][1] - p[i] + p[i+1]});
}
return max(dp[n][0], dp[n][1]);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |