#include <bits/stdc++.h>
using namespace std;
int n, i, j, k, sum, tmp, ans, m, l, r, ql, qr, mn;
int a[1000010], csl[1000010], csr[1000010];
char s[1000010];
bool flag;
int main() {
  cin >> n >> l >> r >> ql >> qr;
  for (i = 0; i < n; i++) cin >> a[i];
  csl[0] = a[0];
  for (i = 1; i < n; i++) csl[i] += csl[i - 1] + a[i];
  csr[n - 1] = a[n - 1];
  for (i = n - 2; i >= 0; i--) csr[i] += csr[i + 1] + a[i];
  mn = (csl[n - 1] * l + ql * (n - 1) < csr[0] * r + qr * (n - 1)
            ? csl[n - 1] * l + ql * (n - 1)
            : csr[0] * r + qr * (n - 1));
  for (i = 0; i < n - 1; i++) {
    sum = csl[i] * l + csr[i + 1] * r;
    if (i + 1 > n - i)
      sum += (i + 1 - n + i) * ql;
    else if (i + 2 < n - i - 1)
      sum += (n - i - 1 - i - 2) * qr;
    if (sum < mn) mn = sum;
  }
  cout << mn << endl;
  return 0;
}
