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 <vector>
#include <algorithm>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
const ll INF = 1'000'000'000'000'000'000LL;
vll minimum_costs(vi H, vi L, vi R)
{
int Q = int(L.size());
vll ans(Q);
for(int j = 0; j < Q; j++)
{
ans[j] = INF;
for(int p = L[j]; p <= R[j]; p++)
{
ll tmp = -H[p];
ll mx = 0;
for(int i = p; i >= L[j]; i--)
{
mx = max(mx, ll(H[i]));
tmp += mx;
}
mx = 0;
for(int i = p; i <= R[j]; i++)
{
mx = max(mx, ll(H[i]));
tmp += mx;
}
ans[j] = min(ans[j], tmp);
}
}
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... |