#include <bits/stdc++.h>
using namespace std;
long long acc_sum[100000 + 5];
long long ml, mr, ql, qr;
long long n;
long long solve(int l, int r) {
  long long ans = 0;
  if (l != 0) ans += acc_sum[l - 1] * ml;
  if (r != 0) ans += (acc_sum[l + r - 1] - acc_sum[l - 1]) * mr;
  if (l > r) {
    ans += (l - r - 1) * ql;
  }
  if (r > l) {
    ans += (r - l - 1) * qr;
  }
  return ans;
}
int main() {
  cin >> n >> ml >> mr >> ql >> qr;
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    cin >> acc_sum[i];
    sum += acc_sum[i];
    acc_sum[i] = sum;
  }
  long long mn;
  for (int i = 0; i < n + 1; i++) {
    if (i == 0) {
      mn = solve(i, n - i);
      continue;
    }
    mn = min(mn, solve(i, n - i));
  }
  cout << mn << endl;
}
