# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
285402 | peti1234 | 모임들 (IOI18_meetings) | C++17 | 0 ms | 0 KiB |
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 <bits/stdc++.h>
using namespace std;
const int c=5002;
vector<long long> sz;
long long n, q, mini[c][c], kom[c][c];
vector<long long> minimum_cost(vector<int> h, vector<int> l, vector<int> r) {
n=h.size(), q=l.size();
for (int i=0; i<n; i++) mini[i][i]=h[i];
for (int i=0; i<n; i++) for (int j=i+1; j<n; j++) mini[i][j]=min(mini[i][j-1], mini[j][j]);
for (int i=0; i<n; i++) for (int j=1; j<=n; j++) kom[i][j]=kom[i][j-1]+mini[i][j-1];
for (int i=0; i<q; i++) {
long long ans=1e18;
for (int j=l[i]; j<=r[i]; j++) {
ans=min(ans, kom[i][r[i]+1]-kom[i][l[i]]);
}
sz.push_back(ans);
}
return sz;
}