#include <bits/stdc++.h>
using namespace std;
long long w[100010], sum1[100010], sum2[100010];
int main() {
  long long n, l, r, Ql, Qr;
  cin >> n >> l >> r >> Ql >> Qr;
  for (int i = 0; i < n; i++) cin >> w[i];
  sum1[0] = w[n] = 0;
  for (int i = 1; i <= n; i++) sum1[i] = sum1[i - 1] + w[i - 1] * l;
  sum2[n] = 0;
  for (int i = n - 1; i >= 0; i--) sum2[i] = sum2[i + 1] + w[i] * r;
  long long ans = 1000000LL * 1000000LL * 1000LL;
  for (long long i = 0; i <= n; i++) {
    long long now;
    if (i <= n - i)
      now = sum1[i] + sum2[i] + max(0LL, n - 1 - (2 * min(i, n - i))) * Qr;
    else
      now = sum1[i] + sum2[i] + max(0LL, n - 1 - (2 * min(i, n - i))) * Ql;
    ans = min(ans, now);
  }
  cout << ans << endl;
  return 0;
}
