#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
const long long LLINF = 1e18 + 5;
int i4[4] = {1, 0, -1, 0};
int j4[4] = {0, 1, 0, -1};
void solve() {
  int n, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  vector<int> costs(n);
  vector<int> prefR(n + 1), prefL(n + 1);
  int sum = 0;
  for (int i = 0; i < n; i++) {
    cin >> costs[i];
    sum += costs[i];
    prefL[i + 1] = sum;
  }
  for (int i = 0; i < n; i++) {
    prefR[i + 1] = prefR[i] + costs[n - i - 1];
  }
  int ans = INF;
  for (int i = 0; i <= n; i++) {
    int cur = prefL[i] * l + prefR[n - i] * r;
    if (i > n - i) cur += (2 * i - n - 1) * ql;
    if (n - i > i) cur += (n - (2 * i) - 1) * qr;
    ans = min(ans, cur);
  }
  cout << ans << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
