#include <bits/stdc++.h>
using namespace std;
long long f(int l, int r, int ql, int qr) {
  if (l < r) {
    swap(l, r);
    swap(ql, qr);
  }
  return max(0, (l - r - 1)) * ql;
}
vector<long long> w;
int main() {
  int t;
  int n, l, r, ql, qr;
  scanf("%d%d%d%d%d", &n, &l, &r, &ql, &qr);
  w.resize(n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &w[i]);
  }
  long long current_sum = 0;
  for (int i = 0; i < n; i++) {
    current_sum += r * w[i];
  }
  long long current_best = current_sum + f(0, n, ql, qr);
  for (int i = 1; i <= n; i++) {
    current_sum = current_sum - w[i - 1] * r + w[i - 1] * l;
    current_best = min(current_best, current_sum + f(i, n - i, ql, qr));
  }
  cout << current_best << endl;
  return 0;
}
