#include <bits/stdc++.h>
using namespace std;
int main() {
  int a[100005];
  a[0] = 0;
  int n, l, r, ql, qr, i;
  cin >> n >> l >> r >> ql >> qr;
  for (i = 1; i <= n; i++) cin >> a[i];
  for (i = 2; i <= n; i++) a[i] += a[i - 1];
  int ans = INT_MAX;
  for (i = 0; i <= n; i++) {
    int temp = a[i] * l + (a[n] - a[i]) * r;
    if (2 * i >= n)
      temp += max(0, (2 * i - n - 1)) * ql;
    else
      temp += max(0, (n - 2 * i - 1)) * qr;
    ans = min(ans, temp);
  }
  cout << ans;
  return 0;
}
