#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, l, r;
  long long ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  int* a = new int[n + 5];
  long long *suml = new long long[n + 5], *sumr = new long long[n + 5];
  long long* maxs = new long long[n + 5];
  suml[0] = 0;
  sumr[n + 1] = 0;
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i <= n; i++) suml[i] = suml[i - 1] + (l * a[i]);
  for (int i = n; i >= 1; i--) sumr[i] = sumr[i + 1] + (r * a[i]);
  for (int i = 0; i < n + 1; i++) {
    int lp = i, rp = n - i;
    maxs[i] = suml[i] + sumr[i + 1];
    if (lp < rp) {
      if (lp + 1 < rp) {
        maxs[i] += (rp - lp - 1) * qr;
      }
    }
    if (rp < lp) {
      if (rp + 1 < lp) {
        maxs[i] += (lp - rp - 1) * ql;
      }
    }
  }
  long long min = maxs[0];
  for (int i = 1; i < n + 1; i++) {
    if (maxs[i] < min) min = maxs[i];
  }
  cout << min;
  return 0;
}
