#include <bits/stdc++.h>
using namespace std;
int a[100007];
long long L[100007], R[100007];
int main() {
  int n, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) {
    L[i] = L[i - 1] + a[i];
    R[i] = R[i - 1] + a[n - i + 1];
  }
  long long ans = 1e+16;
  for (int i = 0; i <= n; i++) {
    if (i == n - i) ans = min(ans, L[i] * l + R[n - i] * r);
    if (i > n - i)
      ans = min(ans, L[i] * l + R[n - i] * r + (n - (n - i) * 2 - 1) * ql);
    if (i < n - i)
      ans = min(ans, L[i] * l + R[n - i] * r + (n - i * 2 - 1) * qr);
  }
  cout << ans;
  return 0;
}
