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"
using namespace std;
int cost[5000][5000];
long long psum[5000][5001];
vector<long long> minimum_costs(vector<int> h,vector<int> l,vector<int> r) {
int q=l.size();
int n=h.size();
for(int i=0;i<n;i++) {
cost[i][i]=h[i];
for(int j=i-1;j>=0;j--) {
cost[i][j]=max(cost[i][j+1],h[j]);
}
for(int j=i+1;j<n;j++) {
cost[i][j]=max(cost[i][j-1],h[j]);
}
for(int j=0;j<n;j++) {
psum[i][j+1]=psum[i][j]+cost[i][j];
}
}
vector<long long> ret;
for(int i=0;i<q;i++) {
long long mn=1e18;
for(int j=0;j<n;j++) {
mn=min(mn,psum[j][r[i]+1]-psum[j][l[i]]);
}
ret.push_back(mn);
}
return ret;
}
# | 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... |