func_code_string: #include <bits/stdc++.h>   using namespace std;   const int INF = 0x3f3f3f3f;   const int maxn = 100005;   int a[maxn], lefts[maxn], rights[maxn];   int main() {     int n, l, r, q1, q2;     cin >> n >> l >> r >> q1 >> q2;     memset(lefts, 0, sizeof(lefts));     memset(rights, 0, sizeof(rights));     for (int i = 0; i < n; i++) {       cin >> a[i];       lefts[i + 1] += (lefts[i] + a[i]);     }     for (int i = n - 1; i >= 0; i--) {       rights[n - i] += (rights[n - i - 1] + a[i]);     }     int sum = 0, ans = INF;     for (int i = 0; i <= n; i++) {       sum = 0;       sum += ((lefts[i] * l) + rights[n - i] * r);       if (i > (n - i))         sum += ((2 * i - n - 1) * q1);       else if (i < (n - i))         sum += ((n - 2 * i - 1) * q2);       ans = min(ans, sum);     }     cout << ans << endl;     return 0;   }   