#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.1415926535897932384626433832795;
const long double EPS = 1e-11;
int n, l, r, ql, qr;
signed long long a[100100], s[100100], ts;
char hod = 'Z';
signed long long ans = 999999999ll * 999999999;
;
int main() {
  cin >> n >> l >> r >> ql >> qr;
  for (int i = 0; i < (n); i++) cin >> a[i];
  for (int i = 0; i < (n); i++) s[i + 1] = s[i] + a[i];
  for (int i = 0; i < (n + 1); i++) {
    ts = l * s[i] + r * (s[n] - s[i]);
    if (i < n - i) ts += qr * (n - 2 * i - 1);
    if (i > n - i) ts += ql * (2 * i - n - 1);
    ans = min(ans, ts);
  }
  cout << ans;
  return 0;
}
