#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  int pre[n], post[n];
  pre[0] = a[0];
  post[n - 1] = a[n - 1];
  for (int i = 1; i < n; i++) pre[i] = pre[i - 1] + a[i];
  for (int i = n - 2; i >= 0; i--) post[i] = post[i + 1] + a[i];
  int m = INT_MAX;
  for (int i = 0; i < n; i++) {
    int c = 0;
    if (i + 1 > (n + 1) / 2)
      c += ql * max(0, ((n - (n - i - 1) * 2) - 1));
    else
      c += qr * max(0, (n - (i + 1) * 2 - 1));
    m = min(m, pre[i] * l + (post[i] - a[i]) * r + c);
  }
  m = min(m, post[0] * r + qr * (n - 1));
  cout << m;
}
