#include <bits/stdc++.h>
using namespace std;
long int n, l, r, q1, q2;
long int w[100001], sum[100001] = {0}, ans[100001];
int main() {
  long int i, j, a, b, c, min;
  cin >> n >> l >> r >> q1 >> q2;
  for (i = 1; i <= n; i++) {
    cin >> w[i];
    sum[i] = w[i] + sum[i - 1];
  }
  for (i = 0; i <= n; i++) {
    ans[i] = sum[i] * l + (sum[n] - sum[i]) * r;
    if (i < n / 2) {
      a = n - (2 * i + 1);
      ans[i] = ans[i] + a * q2;
    } else if (i > n / 2) {
      a = 2 * i - 1 - n;
      ans[i] = ans[i] + a * q1;
    }
    if (i == 0) {
      min = ans[0];
    } else if (min > ans[i]) {
      min = ans[i];
    }
  }
  cout << min;
  return 0;
}
