#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N], n, l, r, ql, qr;
long long lf, rt, ans;
int main() {
  scanf("%d%d%d%d%d", &n, &l, &r, &ql, &qr);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    rt += a[i] * r;
  }
  ans = (rt + qr * (n - 1));
  for (int i = 1; i <= n; ++i) {
    lf += a[i] * l;
    rt -= a[i] * r;
    ans = min(ans, lf + ql * max(0, n - (n - i) * 2 - 1) + rt +
                       qr * max(0, n - i * 2 - 1));
  }
  printf("%I64d", ans);
  return 0;
}
