#include <bits/stdc++.h>
using namespace std;
long long int a[100005];
int main() {
  long long int i, j, k, l, n, m, t, T, f, p, cnt, par, ele, x, y, ans, sum,
      diff, prod, prev, r, ql, qr, mx1, mx2;
  long long int s[100005], sr[100005], a[100005], d, mn;
  scanf("%I64d", &n);
  scanf("%I64d", &l);
  scanf("%I64d", &r);
  scanf("%I64d", &ql);
  scanf("%I64d", &qr);
  s[0] = 0;
  for (i = 1; i <= n; i++) {
    scanf("%I64d", &a[i]);
    s[i] = s[i - 1] + a[i];
  }
  for (i = n; i >= 0; i--) {
    sr[i] = s[n] - s[i];
  }
  mn = 1000000007;
  for (i = 0; i <= n; i++) {
    if (i < n - i) {
      d = n - 2 * i - 1;
      ans = s[i] * l + sr[i] * r + (d >= 0 ? d : 0) * qr;
      mn = min(mn, ans);
    } else {
      d = 2 * i - n - 1;
      ans = s[i] * l + sr[i] * r + (d >= 0 ? d : 0) * ql;
      mn = min(mn, ans);
    }
  }
  printf("%I64d\n", mn);
  return 0;
}
