#include "nile.h"
#define pb push_back
#include<bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
int n, q;
long long w[maxn], a[maxn], b[maxn];
long long dp[maxn]; /// best match count
long long solve(int d)
{
dp[0] = 0;
for (int i = 1; i < n; ++ i)
{
int curr = 0;
if(i > 0 && w[i] - w[i-1] <= d)curr ++;
dp[i] = max(dp[i-1], dp[i-2] + curr);
}
long long taken = dp[n-1];
long long single = n - dp[n-1];
return (single * 2 + taken);
}
std::vector<long long> calculate_costs(std::vector<int> W, std::vector<int> A,
std::vector<int> B, std::vector<int> E)
{
n = W.size();
for (int i = 0; i < n; ++ i)
w[i] = W[i];
for (int i = 0; i < n; ++ i)
a[i] = A[i];
for (int i = 0; i < n; ++ i)
b[i] = B[i];
sort(w, w+n);
q = (int)E.size();
vector < long long > res;
for (auto d: E)
{
res.pb(solve(d));
}
return res;
}
