QBTICKET - Mua vé tàu hoả
Tác giả: happyboy99x
Ngôn ngữ: C++
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define sz(a) int((a).size())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(c,i) for(typeof((c).begin()) i = (c).begin(), _e = (c).end(); it != _e; ++it)
#define present(c,x) ((c).find(x) != (c).end())
#define cpresent(c,x) (find(all(c),x) != (c).end())
#define rep(i,n) for(int i = 0, _n = (n); i < _n; ++i)
#define repd(i,n) for(int i = (n)-1; i >= 0; --i )
#define fo(i,a,b) for(int i = (a), _b = (b); i <= _b; ++i)
#define fod(i,a,b) for(int i = (a), _b = (b); i >= _b; --i)
#define INF 1000000000
#define N 100005
typedef long long LL;
int l[3], c[3], n, s, f; //a[i] = k/c giua ga 1 va ga i
long long d[N], a[N];
void enter() {
scanf("%d%d%d%d%d%d%d%d%d",l,l+1,l+2,c,c+1,c+2,&n,&s,&f);
if(s>f) swap(s,f);
fo(i,2,n) scanf("%lld",a+i);
}
//LL min(LL a, LL b) { return a < b ? a : b; }
void process() {
fill(d+s+1, d+n+1, LLONG_MAX-2*INF);
fo(i,s+1,f) {
rep(k,3) {
int p = lower_bound(a+1, a+n+1, a[i] - l[k]) - a;
d[i] = min(d[i], d[p] + c[k]);
}
}
cout << d[f] << endl;
//cout << *min_element(d+f, d+n+1) << endl;
}
int main() {
//freopen("input.txt", "r", stdin);
enter();
process();
return 0;
}