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 "meetings.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> minimum_costs(vector<int> H, vector<int> L, vector<int> R) {
int N = H.size();
int Q = L.size();
vector pfs(N, vector<ll>(N + 1));
for (int i = 0; i < N; i++) {
vector<int> mx(N);
mx[i] = H[i];
for (int j = i - 1; j >= 0; j--) {
mx[j] = max(mx[j + 1], H[j]);
}
for (int j = i + 1; j < N; j++) {
mx[j] = max(mx[j - 1], H[j]);
}
for (int j = 0; j < N; j++) {
pfs[i][j + 1] = pfs[i][j] + mx[j];
}
}
vector<ll> ans(Q);
for (int i = 0; i < Q; i++) {
for (int j = L[i]; j <= R[i]; j++) {
ans[i] = max(ans[i], pfs[j][R[i] + 1] - pfs[j][L[i]]);
}
}
return ans;
}
# | 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... |