#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 1;
int n, l, r, Q1, Q2;
int w[MAXN];
long long f(int left, int right) {
  return max(0, left - right - 1) * Q1 + max(0, right - left - 1) * Q2;
}
int main() {
  scanf("%d %d %d %d %d", &n, &l, &r, &Q1, &Q2);
  for (int i = 0; i < n; i++) {
    scanf("%d", &w[i]);
  }
  int left = n;
  int right = 0;
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    sum += w[i] * l;
  }
  long long res = sum + f(left, right);
  for (int i = n - 1; i >= 0; i--) {
    sum -= w[i] * l;
    ;
    sum += w[i] * r;
    left--;
    right++;
    res = min(res, sum + f(left, right));
  }
  printf("%I64d\n", res);
}
