#include "nile.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using vi = vector<int>;
// input
// W[i] = weight of artifact i
// A[i] = cost of transporting artifact i by itself
// B[i] = cost of transporting artifact i with another artifact
// E[j] = maximum weight different for artifacts going together for query j
// output
// R[i] = min cost of transporting all artifacts, when D = R[j]
vector<ll> calculate_costs(vi W, vi A, vi B, vi E) {
int N = W.size(), Q = E.size();
vector<ll> R(Q, 0);
vector<ll> DP(N + 1, 0);
DP[1] = A[0];
for (int i = 2; i <= N; i++) {
DP[i] = min(DP[i - 1] + A[i - 1], DP[i - 2] + B[i - 1] + B[i - 2]);
}
for (int j = 0; j < Q; j++) {
ll cost;
R[j] = DP[N];
}
return R;
}
