#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long n, l, r, ql, qr, w[N], pre[N];
int main() {
  cin >> n >> l >> r >> ql >> qr;
  for (int i = 0; i < n; i++) {
    cin >> w[i];
    pre[i + 1] = pre[i] + w[i];
  }
  long long ans = 1e18;
  for (int i = 0; i <= n; i++) {
    long long ret = pre[i] * l + (pre[n] - pre[i]) * r;
    if (i <= n - i) {
      ret += qr * max(0LL, (n - i - i - 1));
    } else {
      ret += ql * max(0LL, (i + i - n - 1));
    }
    ans = min(ans, ret);
  }
  cout << ans << '\n';
  return 0;
}
