#include <bits/stdc++.h>
using namespace std;
int n, l, r, ql, qr;
int a[100010];
int main() {
  cin >> n >> l >> r >> ql >> qr;
  int tot = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    tot += a[i] * r;
  }
  int ans = 2000000000;
  ans = min(ans, tot + (n - 1) * qr);
  for (int i = 0; i < n; i++) {
    tot -= a[i] * r;
    tot += a[i] * l;
    int x1 = i + 1;
    int x2 = n - 1 - i;
    if (x1 > x2)
      ans = min(ans, tot + (x1 - x2 - 1) * ql);
    else if (x1 < x2)
      ans = min(ans, tot + (x2 - x1 - 1) * qr);
    else
      ans = min(ans, tot);
  }
  cout << ans << endl;
}
