#include <bits/stdc++.h>
using namespace std;
int n, l, r, hh, ql, qr, i, j, sum, ans, a[200001];
int main() {
  scanf("%d%d%d%d%d", &n, &l, &r, &ql, &qr);
  for (i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    sum += a[i] * r;
  }
  ans = 1e9;
  for (i = 0; i < n; i++) {
    hh = sum;
    if (i >= n - i)
      hh += ql * (max(0, i - (n - i) - 1));
    else
      hh += qr * (max(0, n - i - i - 1));
    ans = min(ans, hh);
    sum -= a[i + 1] * r;
    sum += a[i + 1] * l;
  }
  hh = sum;
  if (i >= n - i)
    hh += ql * (max(0, i - (n - i) - 1));
  else
    hh += qr * (max(0, n - i - i - 1));
  ans = min(ans, hh);
  printf("%d", ans);
}
