#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:256000000")
template <class T>
T sqr(T a) {
  return a * a;
}
long long n, l, r, ql, qr;
int w[1 << 17];
long long suml[1 << 17] = {0};
long long sumr[1 << 17] = {0};
void solve() {
  for (int i = 0; i < n; ++i) {
    suml[i] = w[i] * l;
    if (i) suml[i] += suml[i - 1];
  }
  for (int i = n - 1; i >= 0; --i) {
    sumr[i] = w[i] * r;
    if (i != n - 1) sumr[i] += sumr[i + 1];
  }
  long long res = ((1ll << 60) - 1);
  for (int i = 0; i < n + 1; ++i) {
    long long r = 0;
    if (i) r += suml[i - 1];
    if (i != n) r += sumr[i];
    int q1 = i;
    int q2 = n - q1;
    if (q1 > q2)
      r += ql * (q1 - q2 - 1);
    else if (q1 != q2)
      r += qr * (q2 - q1 - 1);
    res = min(res, r);
  }
  cout << res << endl;
}
int main() {
  scanf("%lld%lld%lld%lld%lld", &n, &l, &r, &ql, &qr);
  for (int i = 0; i < n; ++i) scanf("%d", &w[i]);
  solve();
  return 0;
}
