#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
long long arr[100002];
int main() {
  long long n, l, r, q1, q2, ans = 1e18;
  cin >> n >> l >> r >> q1 >> q2;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    arr[i] = arr[i - 1] + x;
  }
  for (int i = 0; i <= n; i++) {
    int tmp = 0;
    if (i > n - i)
      tmp = q1 * ((2 * i) - n - 1);
    else if (i < n - i)
      tmp = q2 * (n - (2 * i) - 1);
    ans = min(ans, l * arr[i] + r * (arr[n] - arr[i]) + tmp);
  }
  cout << ans;
}
