#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int maxn = 1e5 + 10;
int vet[maxn], acul[maxn];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  cout << fixed;
  int n, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  for (int(i) = 0; (i) < (int)(n); (i)++) cin >> vet[i];
  acul[0] = 0;
  vet[n] = 0;
  for (int i = (int)(1); i <= (int)(n + 1); ++i)
    acul[i] = acul[i - 1] + vet[i - 1];
  long long ans = inf;
  for (int(i) = 0; (i) < (int)(n + 1); (i)++) {
    int qtd = max(0, abs(n - i - i) - 1);
    long long tot = 0;
    if (i <= n / 2)
      tot += (qtd * qr);
    else
      tot += (qtd * ql);
    tot += acul[i] * l;
    tot += (acul[n] - acul[i]) * r;
    ans = min(ans, tot);
  }
  cout << ans << endl;
  return 0;
}
