#include <bits/stdc++.h>
using namespace std;
const int NMAX = 100005;
int n, L, R, Qi, Qr, w[NMAX], Left[NMAX], Right[NMAX];
int main() {
  cin >> n >> L >> R >> Qi >> Qr;
  for (int i = 1; i <= n; i++) cin >> w[i];
  for (int i = 1; i <= n; i++) {
    Left[i] += Left[i - 1] + w[i];
    Right[n - i + 1] += Right[n - i + 2] + w[n - i + 1];
  }
  long long sol = (1LL << 60), s;
  for (int i = 0; i <= n; i++) {
    s = 1LL * Left[i] * L + 1LL * Right[i + 1] * R;
    if (i > n - i) s += 1LL * (2 * i - n - 1) * Qi;
    if (i < n - i) s += 1LL * (n - 2 * i - 1) * Qr;
    sol = min(sol, s);
  }
  cout << sol << "\n";
  return 0;
}
