#include <bits/stdc++.h>
using namespace std;
int i, j, k, n, m, l, r, ql, qr;
int w[100010], an;
int main() {
  scanf("%d%d%d%d%d", &n, &l, &r, &ql, &qr);
  for (i = 1; i <= n; i++) scanf("%d", &w[i]), w[i] += w[i - 1];
  an = 2147483647;
  for (i = 0; i <= n / 2; i++) {
    int A = w[i] * l + (w[n] - w[n - i]) * r;
    an = min(an, A + (w[n - i] - w[i]) * l + max(0, n - i - i - 1) * ql);
    an = min(an, A + (w[n - i] - w[i]) * r + max(0, n - i - i - 1) * qr);
  }
  printf("%d\n", an);
  return 0;
}
