#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
long long a[N];
long long pre[N];
long long suf[N];
int main() {
  long long n, lm, rm, ql, qr;
  cin >> n >> lm >> rm >> ql >> qr;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    pre[i] = a[i] * lm + pre[i - 1];
    suf[i] = a[i] * rm;
  }
  for (int i = n; i >= 1; i--) suf[i] += suf[i + 1];
  long long ans = 1e18;
  for (int i = 0; i <= n; i++) {
    long long v = pre[i] + suf[i + 1];
    long long h = n - 2 * i;
    if (h < 0) {
      h = -h;
      h--;
      h = max(h, (long long)0);
      h *= ql;
    } else {
      h--;
      h = max(h, (long long)0);
      h *= qr;
    }
    v += h;
    ans = min(ans, v);
  }
  cout << ans;
}
