#include <bits/stdc++.h>
using namespace std;
int w[100001];
int s[100001];
int main() {
  int n, l, r, ql, qr;
  scanf("%d %d %d %d %d", &n, &l, &r, &ql, &qr);
  for (int i = 1; i <= n; ++i) scanf("%d", &w[i]), s[i] = s[i - 1] + w[i];
  int mn = 2000000000;
  int j;
  for (int i = 0; i <= n; ++i) {
    int cost = s[i] * l + (s[n] - s[i]) * r;
    if (i < n - i)
      cost += qr * (n - 2 * i - 1);
    else if (i == n - i)
      ;
    else
      cost += ql * (2 * i - n - 1);
    if (mn > cost) mn = cost, j = i;
  }
  printf("%d\n", mn);
  return 0;
}
