#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;
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;
}
long long int findMaxAttraction(int N, int start, int d, int attraction[]) {
n = N;
for(int i=0; i<n; i++) a[i] = attraction[i];
return f(start, 0, d);
}
