#include <bits/stdc++.h>
int w[100005];
int N, L, R, ql, qr;
int main() {
  scanf("%d%d%d%d%d", &N, &L, &R, &ql, &qr);
  int sum = 0;
  for (int i = 1; i <= N; ++i) {
    scanf("%d", &w[i]);
    sum += w[i];
  }
  w[0] = 0;
  int ans = 0x7fffffff;
  int suml = 0;
  int t;
  for (int i = 0; i <= N; ++i) {
    t = 0;
    if (N > 2 * i + 1)
      t = (N - 2 * i - 1) * qr;
    else if (2 * i > N + 1)
      t = (2 * i - N - 1) * ql;
    suml += w[i];
    sum -= w[i];
    t += suml * L + sum * R;
    if (t < ans) ans = t;
  }
  printf("%d\n", ans);
}
