Problem:
Score : 400 points

Problem Statement

Your friend gave you a dequeue D as a birthday present.

D is a horizontal cylinder that contains a row of N jewels.

The values of the jewels are V_1, V_2, ..., V_N from left to right. There may be jewels with negative values.

In the beginning, you have no jewel in your hands.

You can perform at most K operations on D, chosen from the following, at most K times (possibly zero):

Operation A: Take out the leftmost jewel contained in D and have it in your hand. You cannot do this operation when D is empty.

Operation B: Take out the rightmost jewel contained in D and have it in your hand. You cannot do this operation when D is empty.

Operation C: Choose a jewel in your hands and insert it to the left end of D. You cannot do this operation when you have no jewel in your hand.

Operation D: Choose a jewel in your hands and insert it to the right end of D. You cannot do this operation when you have no jewel in your hand.

Find the maximum possible sum of the values of jewels in your hands after the operations.

Constraints

All values in input are integers.

1 \leq N \leq 50

1 \leq K \leq 100

-10^7 \leq V_i \leq 10^7

Input

Input is given from Standard Input in the following format:

N K
V_1 V_2 ... V_N

Output

Print the maximum possible sum of the values of jewels in your hands after the operations.

Sample Input 1

6 4
-10 8 2 1 2 6

Sample Output 1

14

After the following sequence of operations, you have two jewels of values 8 and 6 in your hands for a total of 14, which is the maximum result.

Do operation A. You take out the jewel of value -10 from the left end of D.

Do operation B. You take out the jewel of value 6 from the right end of D.

Do operation A. You take out the jewel of value 8 from the left end of D.

Do operation D. You insert the jewel of value -10 to the right end of D.

Sample Input 2

6 4
-6 -100 50 -2 -5 -3

Sample Output 2

44

Sample Input 3

6 3
-6 -100 50 -2 -5 -3

Sample Output 3

0

It is optimal to do no operation.

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

#define MAX_N 50
int v[MAX_N];
int n;
int k;

int favour_left[MAX_N][MAX_N + 1];
int favour_right[MAX_N][MAX_N + 1];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    int i;
    for(i = 0; i < n; ++i){
        cin >> v[i];
    }
    int j;
    for(i = 1; i <= n; ++i){
        priority_queue<int, vector<int>, greater<int> > q;
        int max_sum = 0;
        for(j = 0; j < i; ++j){
            max_sum += v[j];
            q.push(v[j]);
        }
        favour_left[i - 1][i] = max_sum;
        for(j = i; j < n; ++j){
            if(v[j] > q.top()){
                max_sum -= q.top();
                q.pop();
                max_sum += v[j];
                q.push(v[j]);
            }
            favour_left[j][i] = max_sum;
        }
    }
    for(i = 1; i <= n; ++i){
        priority_queue<int, vector<int>, greater<int> > q;
        int max_sum = 0;
        for(j = 0; j < i; ++j){
            max_sum += v[n - 1 - j];
            q.push(v[n - 1 - j]);
        }
        favour_right[i - 1][i] = max_sum;
        for(j = i; j < n; ++j){
            if(v[n - 1 - j] > q.top()){
                max_sum -= q.top();
                q.pop();
                max_sum += v[n - 1 - j];
                q.push(v[n - 1 - j]);
            }
            favour_right[j][i] = max_sum;
        }
    }
    int max_favour = 0;
    int p, q;
    for(i = 0; i < n; ++i){
        for(p = i + 1; p >= 0; --p){
            int op_left = i + 1 + (i + 1 - p);
            if(op_left > k){
                break;
            }
            max_favour = max(max_favour, favour_left[i][p]);
        }
    }
    for(j = 0; j < n; ++j){
        for(q = j + 1; q >= 0; --q){
            int op_right = j + 1 + (j + 1 - q);
            if(op_right > k){
                break;
            }
            max_favour = max(max_favour, favour_right[j][q]);
        }
    }
    for(i = 0; i < n; ++i){
        for(j = 0; j < n && i + j + 1 < n; ++j){
            for(p = i + 1; p >= 0; --p){
                int op_left = i + 1 + (i + 1 - p);
                if(op_left > k){
                    break;
                }
                for(q = j + 1; q >= 0; --q){
                    int op_right = j + 1 + (j + 1 - q);
                    if(op_left + op_right > k){
                        break;
                    }
                    max_favour = max(max_favour, favour_left[i][p] + favour_right[j][q]);
                }
            }
        }
    }
    cout << max_favour << '\n';
    return 0;
}