# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1158553 | SulA | Meetings (IOI18_meetings) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define popcount __builtin_popcount
using namespace std;
vector<long long> minimum_costs(vector<int> H, vector<int> l, vector<int> r) {
int n = H.size(), q = l.size();
vector<long long> ans(q);
for (int i = 0; i < q; i++) {
for (int x = l[i]; x <= r[i]; x++) {
int mx = 0;
for (int y = x; y >= l[i]; y--) {
mx = max(mx, H[y]);
ans[i] += mx;
}
mx = H[x];
for (int y = x+1; y <= r[i]; y++) {
mx = max(mx, H[y]);
ans[i] += mx;
}
}
}
return ans;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n; cin>>n;
int a[n+1];
}