#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, l, r, ql, qr;
  long long ans, curr;
  int w[100000], sumleft[100001], sumright[100001];
  scanf("%d%d%d%d%d", &n, &l, &r, &ql, &qr);
  for (int i = 0; i < n; i++) {
    scanf("%d", &w[i]);
  }
  sumleft[0] = 0;
  for (int i = 1; i <= n; i++) {
    sumleft[i] = sumleft[i - 1] + w[i - 1];
  }
  sumright[0] = 0;
  for (int i = 1; i <= n; i++) {
    sumright[i] = sumright[i - 1] + w[n - i];
  }
  ans = 10000000001LL;
  for (int i = 0; i <= n; i++) {
    curr = sumleft[i] * l + sumright[n - i] * r;
    if (i > n - i) curr += ql * (2 * i - n - 1);
    if (i < n - i) curr += qr * (n - 2 * i - 1);
    ans = min(ans, curr);
  }
  printf("%lld\n", ans);
  return 0;
}
