#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int a[maxn], pre[maxn], suff[maxn];
int main(int argc, char const *argv[]) {
  int n, l, r, x, y;
  scanf("%d %d %d %d %d", &n, &l, &r, &x, &y);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  for (int i = 1; i <= n; i++) {
    pre[i] = pre[i - 1] + a[i];
  }
  for (int i = n; i > 0; i--) {
    suff[i] = suff[i + 1] + a[i];
  }
  long long ans = 1e17;
  for (int i = 0; i <= n; i++) {
    long long val = (pre[i] * l) + (suff[i + 1] * r);
    if (i < n - i)
      val += max((n - 2 * i - 1), 0) * y;
    else
      val += max((2 * i - n - 1), 0) * x;
    ans = min(ans, val);
  }
  cout << ans << endl;
  return 0;
}
