#include <bits/stdc++.h>
#include"holiday.h"
using namespace std;
typedef long long ll;
const int nax = 20;
ll a[nax+5];
map<tuple<int,int,int>, ll> memo;
int n;
ll f (int idx, int vis, int rem) {
if(rem == 0) return 0;
if(memo.count({idx, vis, rem})) return memo[{idx, vis, rem}];
ll &ret = memo[{idx, vis, rem}];
if((vis & (1<<idx)) == 0) ret = max(ret, a[idx] + f(idx, vis | (1<<idx), rem-1));
if(idx != 0) ret = max(ret, f(idx-1, vis, rem-1));
if(idx != n-1) ret = max(ret, f(idx+1, vis, rem-1));
//cerr << idx << " " << vis << " " << rem << endl;
return ret;
}
int s, d;
bool ok (int mask) {
int l=n, r=0;
for(int i=0; i<mask; i++) {
if(mask & (1<<i)) {
l = min(l, i);
r = max(r, i);
}
}
int travel = (r-l) + min(abs(s-l), abs(r-s));
return travel + __builtin_popcount(mask) <= d;
}
long long int findMaxAttraction(int N, int S, int D, int attraction[]) {
n = N;
s = S; d = D;
ll ans = 0;
for(int mask = 1; mask <(1<<n); mask++) {
if(ok(mask)) {
ll sum = 0;
for(int i=0; i<N; i++) if(mask & (1<<i)) sum += attraction[i];
ans = max(ans, sum);
}
}
return ans;
}
