#include <bits/stdc++.h>
using namespace std;
long long int x[1000007], y[1000007], z[1000007], n;
string s, S;
int main() {
  {
    long long int a = 0, b = 0, c = 0, d, diff, e, qr, ql, f, g, i, j, k, l, m,
                  in, mod, loc, p, q, r, u, val, w, t, tc, sz, lo, hi, mid,
                  mn = 2134567891, mx = 0, sum = 0, ans = 2134567891;
    cin >> n >> l >> r >> ql >> qr;
    for (i = 1; i <= n; i++) cin >> x[i];
    for (i = 2; i <= n; i++) x[i] += x[i - 1];
    x[n + 1] = x[n];
    for (i = 0; i <= n + 1; i++) {
      c = x[i] * l + (x[n] - x[i]) * r;
      if (2 * i > n) {
        c += (2 * i - n - 1) * ql;
      } else if (2 * i < n) {
        c += (n - 2 * i - 1) * qr;
      }
      ans = min(c, ans);
    }
    cout << ans;
  }
  return 0;
}
