Submission #6851313

---

Source Code Expand

// {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
// }}}

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;

static constexpr int mod = (int)1e9 + 7;
static constexpr int inf = 100100100;
static constexpr ll linf = 1e18;
static constexpr double eps = 1e-9;
static constexpr double pi = 3.14159265359;

#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rrep(i, n) for (ll i = n; i >= 0; --i)
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define pb push_back
#define ist insert
#define fst first
#define snd second


int main() {
    // cin.tie(0);
    // ios_base::sync_with_stdio(false);
    ll N, K;
    cin >> N >> K;
    deque<ll> d;
    rep (i, N) {
        ll v;
        cin >> v;
        d.pb(v);
    }
    ll M = min(N, K);
    ll ans = -linf;
    for (ll a = 0; a <= M; ++a) {
        for (ll b = 0; a + b <= M; ++b) {
            auto q = d;
            vector<ll> v;
            rep (i, a) {
                v.pb(q.front());
                q.pop_front();
            }
            rep (i, b) {
                v.pb(q.back());
                q.pop_back();
            }
            sort(all(v));
            ll c = 0;
            ll tmp = 0;
            for (ll i : v) {
                if (i < 0 && a + b + c < K) {
                    ++c;
                    continue;
                }
                tmp += i;
            }
            ans = max(ans, tmp);
        }
    }
    cout << ans << endl;
}

Submission Info

Judge Result