#include <bits/stdc++.h>
using namespace std;
int mas1[2000];
int mas2[2000];
vector<int> arr;
int main() {
  int n, l, r, ql, qr;
  long long s = 0, min, cur;
  cin >> n >> l >> r >> ql >> qr;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    s += r * x;
    arr.push_back(x);
  }
  min = s + qr * (n - 1);
  for (int i = 1; i <= n; i++) {
    s = s - r * arr[i - 1] + l * arr[i - 1];
    if (i > (n + 1) / 2)
      cur = (n - 1 - 2 * (n - i)) * ql;
    else if (i < (n + 1) / 2)
      cur = (n - 1 - 2 * i) * qr;
    else
      cur = 0;
    if (min > s + cur) min = s + cur;
  }
  cout << min;
  return 0;
}
