#include <bits/stdc++.h>
using namespace std;
double pi = 3.1415926535898;
const long long M = 1e7 + 9;
const int second = 100100;
int ql, qr, l, r;
int n, now;
int ans = INT_MAX;
int a[second], b[second];
int main() {
  scanf("%d", &n);
  scanf("%d", &l);
  scanf("%d", &r);
  scanf("%d", &ql);
  scanf("%d", &qr);
  for (int i = 1; i <= int(n); ++i) {
    scanf("%d", &a[i]);
    b[i] = b[i - 1] + a[i];
  }
  for (int i = 0; i <= int(n); ++i) {
    now = b[i] * l + (b[n] - b[i]) * r;
    if (i > n - i) now += (2 * i - n - 1) * ql;
    if (i < n - i) now += (n - 2 * i - 1) * qr;
    ans = ans < now ? ans : now;
  }
  cout << ans;
  return 0;
  ;
}
