#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, l, r, a, b;
  scanf("%d%d%d%d%d", &n, &l, &r, &a, &b);
  int arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  int suml[n + 1];
  int sumr[n + 1];
  suml[0] = 0;
  sumr[0] = 0;
  for (int i = 1; i <= n; i++) {
    suml[i] = suml[i - 1] + arr[i - 1];
  }
  int k = 1;
  for (int i = n; i >= 1; i--) {
    sumr[k] = sumr[k - 1] + arr[i - 1];
    k += 1;
  }
  int cur = 0;
  int ans = INT_MAX;
  for (int i = 0; i <= n; i++) {
    cur = suml[i] * l + sumr[n - i] * r;
    if (i > n - i) {
      cur = cur + (2 * i - n - 1) * a;
    }
    if (i < n - i) {
      cur = cur + (n - 2 * i - 1) * b;
    }
    ans = min(ans, cur);
  }
  cout << ans << endl;
}
