#include <bits/stdc++.h>
using namespace std;
int i, f[101010], sum[101010];
int n, l, r, ql, qr;
int main() {
  cin >> n >> l >> r >> ql >> qr;
  for (i = 1; i <= n; i++) scanf("%d", f + i);
  for (i = 1; i <= n; i++) sum[i] = sum[i - 1] + f[i];
  int ans = l * sum[n] + ql * (n - 1);
  for (i = 0; i <= n; i++) {
    int cnt = 0;
    cnt = l * sum[i];
    cnt += r * (sum[n] - sum[i]);
    if (i < n - i)
      cnt += (n - 2 * i - 1) * qr;
    else if (n - i < i)
      cnt += (2 * i - n - 1) * ql;
    ans = min(ans, cnt);
  }
  cout << ans << endl;
  return 0;
}
