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;
vector<long long> minimum_costs(vector<int> H,vector<int> L,vector<int> R)
{
int Q = L.size();
vector<long long> C(Q);
for(int j = 0; j < Q; ++j) {
int l = L[j],r = R[j];
long long ans = LLONG_MAX;
for(int i = l;i <= r;i++)
{
int each = 0;
long long now = 0;
for(int k = i;k >= l;k--) each = max(each,H[i]),now+=each;
each = 0;
for(int k = i;k <= r;k++) each = max(each,H[i]),now+=each;
ans = min(ans,now);
}
C[j] = ans;
}
return C;
}
# | 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... |