#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  int i, a[n + 1];
  int s[n + 1];
  s[0] = 0;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    s[i] = s[i - 1] + a[i];
  }
  long long int ans, max = 10000000000;
  int ri, li;
  for (i = 0; i <= n; i++) {
    ans = (s[i] * l) + (s[n] - s[i]) * r;
    if (i < n / 2) {
      li = 0;
      ri = n - 2 * i;
      if (r <= l) {
        ri = ri - 1;
      }
      if (ri < 0) {
        ri = 0;
      }
    } else {
      li = 2 * i - n;
      ri = 0;
      if (l <= r) {
        li = li - 1;
      }
      if (li < 0) {
        li = 0;
      }
    }
    if (li > ri) {
      ans = ans + (li - ri) * ql;
    } else {
      ans = ans + (ri - li) * qr;
    }
    if (ans < max) {
      max = ans;
    }
  }
  cout << max << "\n";
  return 0;
}
