#include <bits/stdc++.h>
const int N = 100110;
using namespace std;
int main() {
  int n, L, R, ql, qr, w[N];
  cin >> n >> L >> R >> ql >> qr;
  for (int i = 1; i <= n; i++) cin >> w[i];
  int s = 0;
  int l[N];
  l[0] = 0;
  for (int i = 1; i <= n; i++) {
    l[i] = l[i - 1] + L * w[i];
  }
  int r[N];
  r[n + 1] = 0;
  for (int i = n; i >= 1; i--) {
    r[i] = r[i + 1] + R * w[i];
  }
  cout << endl;
  int min = 1000000000;
  for (int k = 0; k <= n; k++) {
    int s = 0;
    s += l[k] + r[k + 1];
    if (k > n / 2) {
      if (k > n - k) s += (k - (n - k) - 1) * ql;
    } else {
      if (n - k > k) s += ((n - k) - k - 1) * qr;
    }
    if (s < min) {
      min = s;
    }
  }
  cout << min;
  return 0;
}
