#include <bits/stdc++.h>
using namespace std;
int n, l, r, ql, qr;
int s, k;
int n1[100050];
int minn = 2000000000;
int main() {
  scanf("%d %d %d %d %d", &n, &l, &r, &ql, &qr);
  for (int i = 0; i < n; i++) scanf("%d", &n1[i]), s += n1[i];
  for (int i = 0; i <= n; i++) {
    int sh = l * (k) + r * (s - k);
    if (i > n - i + 1) sh += ql * (i - (n - i + 1));
    if (i + 1 < n - i) sh += qr * ((n - i) - (i + 1));
    minn = (minn > sh ? sh : minn);
    k += n1[i];
  }
  printf("%d", minn);
  return 0;
}
