#include <bits/stdc++.h>
using namespace std;
int a[100001], suml[100001], sumr[100001];
int main() {
  int n, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  suml[0] = 0, sumr[n + 1] = 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    suml[i] = suml[i - 1] + a[i];
  }
  for (int i = n; i; i--) sumr[i] = sumr[i + 1] + a[i];
  long long mini = 1 << 30, sum = 0;
  for (int i = 0; i <= n; i++) {
    sum = suml[i] * l + sumr[i + 1] * r;
    if (i > n - i) sum += ql * (i * 2 - n - 1);
    if (i < n - i) sum += qr * (n - 2 * i - 1);
    mini = min(mini, sum);
  }
  cout << mini << endl;
  return 0;
}
