#include <bits/stdc++.h>
using namespace std;
long long result = 1000000000000;
long long answ;
int n, l, r, q1, q2;
int arr[100001];
int main() {
  cin >> n >> l >> r >> q1 >> q2;
  for (int i = 1; i <= n; ++i) {
    cin >> arr[i];
    if (i) arr[i] += arr[i - 1];
  }
  for (int i = 0; i <= n; ++i) {
    answ = arr[i] * l + (arr[n] - arr[i]) * r;
    if (i > n - i)
      answ += (2 * i - n - 1) * q1;
    else if (i < n - i)
      answ += (n - 2 * i - 1) * q2;
    result = min(result, answ);
  }
  cout << result << endl;
  return 0;
}
