1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include<bits/stdc++.h>

using namespace std;

const int N = 205;
const long long inf = 2e18 + 10;

long long tbl[N];

map<pair<pair<int, int>, long long>, long long> M;

long long powerOf2(long long k) {

	if (k == 0)
		return 0;

	long long result = 1;
	while(result * 2 <= k)
		result *= 2;
	
	return result;
}

int maximumNumberOfBits(long long k) {

	k++;

	int result = 0;
	while (k > 1)
		k /= 2, result++;

	return result;
}

long long calc(int l, int p, long long k) {

	if (p < l || k < p - l)
		return -inf;

	auto it = M.find({{l, p}, k});
	if (it != M.end()) {
		return it->second;
	}

	if (l == p) {

		long long result = max(0ll, tbl[p] - tbl[l - 1]) * maximumNumberOfBits(k);

		M[{{l, p}, k}] = result;
		return result;
	}

	long long mediumValue = powerOf2(k) - 1;
	long long maxResult = -inf;

	for (int mid = l - 1; mid <= p; mid++) {
		maxResult = max(maxResult, calc(l, mid, mediumValue) + 
									calc(mid + 1, p, k - mediumValue - 1) +
									tbl[p] - tbl[mid]);
	}

	M[{{l, p}, k}] = maxResult;
	return maxResult;
}

void solve() {

	int n;
	long long k;
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> tbl[i];
		tbl[i] += tbl[i - 1];
	}

	/*for (int i = 0; i <= k; i++) {
		cout << i << " " << maximumNumberOfBits(i) << " " << powerOf2(i) << "\n";
	}*/


	cout << calc(1, n, k);

	return;
}

int32_t main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int t = 1;
	//cin >> t;
	while(t--)
		solve();
	return 0;
}