#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using lint = long long; using pint = pair; using plint = pair; struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template void ndarray(vector& vec, const V& val, int len) { vec.assign(len, val); } template void ndarray(vector& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); } template bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; } template bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; } const std::vector> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); } template T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); } template std::pair operator+(const std::pair &l, const std::pair &r) { return std::make_pair(l.first + r.first, l.second + r.second); } template std::pair operator-(const std::pair &l, const std::pair &r) { return std::make_pair(l.first - r.first, l.second - r.second); } template std::vector sort_unique(std::vector vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } template int arglb(const std::vector &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); } template int argub(const std::vector &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); } template IStream &operator>>(IStream &is, std::vector &vec) { for (auto &v : vec) is >> v; return is; } template OStream &operator<<(OStream &os, const std::vector &vec); template OStream &operator<<(OStream &os, const std::array &arr); template OStream &operator<<(OStream &os, const std::unordered_set &vec); template OStream &operator<<(OStream &os, const pair &pa); template OStream &operator<<(OStream &os, const std::deque &vec); template OStream &operator<<(OStream &os, const std::set &vec); template OStream &operator<<(OStream &os, const std::multiset &vec); template OStream &operator<<(OStream &os, const std::unordered_multiset &vec); template OStream &operator<<(OStream &os, const std::pair &pa); template OStream &operator<<(OStream &os, const std::map &mp); template OStream &operator<<(OStream &os, const std::unordered_map &mp); template OStream &operator<<(OStream &os, const std::tuple &tpl); template OStream &operator<<(OStream &os, const std::vector &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } template OStream &operator<<(OStream &os, const std::array &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; } template std::istream &operator>>(std::istream &is, std::tuple &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template OStream &operator<<(OStream &os, const std::tuple &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; } template OStream &operator<<(OStream &os, const std::unordered_set &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::deque &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template OStream &operator<<(OStream &os, const std::set &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::multiset &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::unordered_multiset &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::pair &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; } template OStream &operator<<(OStream &os, const std::map &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::unordered_map &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } #ifdef HITONANODE_LOCAL const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m"; #define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl #define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr) #else #define dbg(x) ((void)0) #define dbgif(cond, x) ((void)0) #endif #include struct S { bool is_empty; lint d = 0; lint add0 = 0, add1 = 0; lint dleft = 0; lint add0left = 0, add1left = 0; S(lint a, lint b, lint c) : is_empty(false), d(a), add0(b), add1(c), dleft(a), add0left(b), add1left(c) {} lint get() const noexcept { if (is_empty) return 0; return add0 + add1 * d; } lint rightget() const noexcept { return get(); } lint leftget() const noexcept { if (is_empty) return 0; return add0left + add1left * dleft; } }; S op(S l, S r) { if (l.is_empty) return r; if (r.is_empty) return l; r.dleft = l.dleft; r.add0left = l.add0left; r.add1left = l.add1left; return r; } S e() { S ret{0, 0, 0}; ret.is_empty = true; return ret; } using F = pair; S mapping(F f, S x) { if (x.is_empty) return x; if (f.first) x.add0 = x.add1 = x.add0left = x.add1left = 0; x.add0 += f.second.first; x.add1 += f.second.second; x.add0left += f.second.first; x.add1left += f.second.second; return x; } F composition(F f, F g) { if (f.first) return f; if (g.first) return {true, f.second + g.second}; return make_pair(false, f.second + g.second); } F id() { return make_pair(false, plint(0, 0)); } int main() { int N, Q; cin >> N >> Q; vector A(N), D(Q); cin >> A >> D; vector diffs(N - 1); REP(i, N - 1) diffs.at(i) = A.at(i + 1) - A.at(i); dbg(make_tuple(N, Q, A, D, diffs)); vector init; const auto sorted_d = sort_unique(D); for (int d : sorted_d) init.push_back(S{d, 0, 0}); // atcoder::lazy_segtree plus_cost_tree(init); atcoder::lazy_segtree minus_cost_tree(init); atcoder::lazy_segtree tree(init); // atcoder::lazy_segtree tree_inv(init); for (const int d : diffs) { int i = arglb(sorted_d, d); // plus_cost_tree.apply(i, sorted_d.size(), F{false, make_pair(-d, 1)}); minus_cost_tree.apply(0, i, F{false, make_pair(d, -1)}); tree.apply(0, D.size(), F{false, make_pair(-d, 1)}); const int r = tree.max_right(0, [&](S x) { return x.rightget() <= 0; }); tree.apply(0, r, F{true, make_pair(0, 0)}); // tree_inv.apply(0, D.size(), F{false, make_pair(d, -1)}); // vector ret; // ret.clear(); // REP(i, D.size()) ret.push_back(tree_inv.get(i).get()); // dbg(make_tuple(d, ret, tree_inv.all_prod().rightget())); // const int r_inv = tree_inv.max_right(0, [&](S x) { return x.rightget() >= 0; }); // tree_inv.apply(0, r_inv, F{true, make_pair(0, 0)}); } for (auto d : D) { const int i = arglb(sorted_d, d); // const auto f0 = plus_cost_tree.get(i).get(); const auto f1 = minus_cost_tree.get(i).get(); const auto f2 = tree.get(i).get(); // const auto f3 = abs(tree_inv.get(i).get()); cout << f1 + f2 << endl; } }