//嗷嗷嗷
//dfs, 剪枝
C++ 代码
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 500;//多开一点, 最后一天加30会爆
int day[N];
int d[N];
int money[3];
int n;
int res = 0x3f3f3f3f;
void dfs (int u, int v)//u是要走哪一天了,v是到这一天的钱数(不一定是最小的)
{
if (v >= d[u]) return;//剪枝
d[u] = v;//存导这一天的最少钱
if (u > day[n])//全走完辣,开始判断
{
res = min (v, res);
return;
}
int t = lower_bound (day + 1, day + 1 + n, u) - day;//二分找到该走哪一天了
dfs (day[t] + 1, v + money[0]);
dfs (day[t] + 7, v + money[1]);
dfs (day[t] + 30, v + money[2]);
}
int main ()
{
memset (d, 0x3f, sizeof d);
cin >> n;
for (int i = 1; i <= n; i ++) cin >> day[i];
day[n + 1] = 400;
for (int i = 0; i < 3; i ++) cin >> money[i];
dfs (day[0], 0);
cout << res;
return 0;
}