#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 FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++) #define IFOR(i, begin, end) for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--) #define REP(i, n) FOR(i, 0, n) #define IREP(i, n) IFOR(i, 0, n) #define ALL(x) (x).begin(), (x).end() // 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; } template pair operator+(const pair& l, const pair& r) { return make_pair(l.first + r.first, l.second + r.second); } template pair operator-(const pair& l, const pair& r) { return make_pair(l.first - r.first, l.second - r.second); } template vector srtunq(vector vec) { return sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()), vec; } template istream& operator>>(istream& is, vector& vec) { return for_each(begin(vec), end(vec), [&](T& v) { is >> v; }), is; } // output template ostream& dmpseq(ostream&, const T&, const string&, const string&, const string&); #if __cplusplus >= 201703L template ostream& operator<<(ostream& os, const tuple& tpl) { return apply([&os](auto&&... args) { ((os << args << ','), ...); }, tpl), os; } #endif // template ostream& operator<<(ostream& os, const pair& p) { return os << '(' << p.first << ',' << p.second << ')'; } template ostream& operator<<(ostream& os, const vector& x) { return dmpseq, T>(os, x, "[", ",", "]"); } template ostream& operator<<(ostream& os, const deque& x) { return dmpseq, T>(os, x, "deq[", ",", "]"); } template ostream& operator<<(ostream& os, const set& x) { return dmpseq, T>(os, x, "{", ",", "}"); } template ostream& operator<<(ostream& os, const unordered_set& x) { return dmpseq, T>(os, x, "{", ",", "}"); } template ostream& operator<<(ostream& os, const multiset& x) { return dmpseq, T>(os, x, "{", ",", "}"); } template ostream& operator<<(ostream& os, const map& x) { return dmpseq, pair>(os, x, "{", ",", "}"); } template ostream& operator<<(ostream& os, const unordered_map& x) { return dmpseq, pair>(os, x, "{", ",", "}"); } template ostream& dmpseq(ostream& os, const T& seq, const string& pre, const string& sp, const string& suf) { return os << pre, for_each(begin(seq), end(seq), [&](V x) { os << x << sp; }), os << suf; } template void print(const vector& x) { dmpseq, T>(cout, x, "", " ", "\n"); } #ifdef HITONANODE_LOCAL #define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl #else #define dbg(x) {} #endif int main() { int N, K; cin >> N >> K; vector A(N); cin >> A; constexpr int INF = 2e9; vector dpl(N, vector(N, vector(K + 1, -INF))); vector dpr(N, vector(N, vector(K + 1, -INF))); REP(i, N) dpl.at(i).at(i).at(K) = dpr.at(i).at(i).at(K) = A.at(i) * K; IFOR(k, 1, K + 1) { REP(l, N) FOR(r, l, N) if (dpl.at(l).at(r).at(k) > -INF) { if (l < r and k > 1) chmax(dpl.at(l).at(r).at(k - 2), dpl.at(l).at(r).at(k)); if (l) chmax(dpl.at(l - 1).at(r).at(k - 1), dpl.at(l).at(r).at(k) + A.at(l - 1) * (k - 1)); if (r + 1 < N and k - (r - l) - 1 >= 0) chmax(dpr.at(l).at(r + 1).at(k - (r - l) - 1), dpl.at(l).at(r).at(k) + A.at(r + 1) * (k - (r - l) - 1)); } REP(l, N) FOR(r, l, N) if (dpr.at(l).at(r).at(k) > -INF) { if (l < r and k > 1) chmax(dpr.at(l).at(r).at(k - 2), dpr.at(l).at(r).at(k)); if (r + 1 < N) chmax(dpr.at(l).at(r + 1).at(k - 1), dpr.at(l).at(r).at(k) + A.at(r + 1) * (k - 1)); if (l and k - (r - l) - 1 >= 0) chmax(dpl.at(l - 1).at(r).at(k - (r - l) - 1), dpr.at(l).at(r).at(k) + A.at(l - 1) * (k - (r - l) - 1)); } } vector> Begin(N), End(N); REP(l, N) FOR(r, l, N) REP(k, K) { int L = l, R = min(r, l + k); if (k % 2) L++; if (k % 2 != (R - l) % 2) R--; if (L <= R) { Begin.at(L).emplace_back(dpl.at(l).at(r).at(k)); End.at(R).emplace_back(dpl.at(l).at(r).at(k)); } } REP(l, N) FOR(r, l, N) REP(k, K) { int R = r, L = max(l, r - k); if (k % 2) R--; if (k % 2 != (r - L) % 2) L++; if (L <= R) { Begin.at(L).emplace_back(dpr.at(l).at(r).at(k)); End.at(R).emplace_back(dpr.at(l).at(r).at(k)); } } vector> ms(2); REP(i, N) { int ret = -INF; ms[i % 2].insert(Begin.at(i).begin(), Begin.at(i).end()); if (ms[i % 2].size()) chmax(ret, *prev(ms[i % 2].end())); for (auto x : End.at(i)) { ms[i % 2].erase(ms[i % 2].lower_bound(x)); } cout << ret << endl; } }