#include <bits/stdc++.h>
int main() {
  int n, lr[2], Q[2], t;
  long long w[100001];
  long long v, r(1LL << 62);
  std::scanf("%d%d%d%d%d", &n, lr, lr + 1, Q, Q + 1);
  for (int i(1); i <= n; ++i) {
    std::scanf("%d", &t);
    w[i] = t;
  }
  for (int i(1); i <= n; ++i) w[i] += w[i - 1];
  for (int i(0); i <= n; ++i) {
    v = std::max({0, (i - (n - i) - 1) * Q[0], ((n - i) - i - 1) * Q[1]});
    v += w[i] * lr[0] + (w[n] - w[i]) * lr[1];
    r = std::min(r, v);
  }
  std::cout << r << std::endl;
  return 0;
}
