#include <bits/stdc++.h>
using namespace std;
int n, l, r, ql, qr, a[100010], ans, sum[100010];
void Init() {
  scanf("%d%d%d%d%d", &n, &l, &r, &ql, &qr);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
}
void solve() {
  int rr, tt2, total;
  ans = 0x7fffffff;
  for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
  for (int i = 0; i <= n; i++) {
    rr = n - i;
    total = 0;
    tt2 = min(i, rr);
    total += (l * sum[i] + r * (sum[n] - sum[n - rr]));
    if (i > rr)
      total += (n - 2 * tt2 - 1) * ql;
    else if (i < rr)
      total += (n - 2 * tt2 - 1) * qr;
    ans = min(ans, total);
  }
  printf("%d\n", ans);
}
int main() {
  Init();
  solve();
  return 0;
}
