#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
int main() {
  {
    long long int n, l, r, q1, q2, m, cost, d, i, s = 0;
    cin >> n >> l >> r >> q1 >> q2;
    long long int a[n], dp[n];
    for (i = 0; i < n; i++) {
      cin >> a[i];
      if (i == 0)
        dp[i] = a[i];
      else
        dp[i] = dp[i - 1] + a[i];
      s += a[i];
    }
    m = r * s + (n - 1) * q2;
    for (i = 0; i < n; i++) {
      cost = dp[i] * l + (s - dp[i]) * r;
      d = (i + 1) - (n - i - 1);
      if (d == 0 || d == -1 || d == 1)
        ;
      else if (d < 0) {
        d++;
        d = abs(d);
        cost += d * q2;
      } else if (d > 0) {
        d--;
        cost += d * q1;
      }
      m = min(m, cost);
    }
    cout << m;
    cout << '\n';
  }
  return 0;
}
