// #define DEBUGGING
#include <bits/stdc++.h>
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
using ll = std::int64_t;
using ull = std::uint64_t;
using PLL = std::pair<ll, ll>;
using TLL = std::tuple<ll, ll, ll>;
template <typename T> using V = std::vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }
#define mv_rec make_v(init, tail...)
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, size_t s, Tail... tail) { return V<decltype(mv_rec)>(s, mv_rec); }
#undef mv_rec
using namespace std;

#ifdef DEBUGGING
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

const size_t SIZE = 5010;
const ll inf = 5e15;
ll dp[SIZE][SIZE];

template <typename T>
struct Bit {
    V<T> data;
    T id_ele;

    Bit(ll size, T id_ele) : id_ele(id_ele) {
        ll bsize = 1;
        while(bsize < size) bsize *= 2;
        data = V<T>(bsize + 1, id_ele);
    }

    T sum(ll pos) {
        T ret = id_ele;
        for(; 0 < pos; pos -= pos & -pos) ret += data[pos];
        return ret;
    }

    T sum(ll l, ll r) { return sum(r) - sum(l); }

    void add(ll pos, T delta) {
        for(++pos; pos < data.size(); pos += pos & -pos) data[pos] += delta;
    }
};

int main() {
    ll N, A, B;
    cin >> N >> A >> B;
    V<ll> P(N), idx_v(N);
    for (ll i = 0; i < N; i++) {
        ll e;
        cin >> e;
        e--;
        P[i] = e;
        idx_v[e] = i;
    }

    Bit<ll> bt(N, 0);
    for (ll i = 0; i < N; i++) bt.add(i, 1);

    for (ll i = 0; i < SIZE; i++) fill(dp[i], dp[i] + SIZE, inf);
    dp[0][0] = 0;
    for (ll i = 0; i < N; i++) {
        ll idx = idx_v[i];
        for (ll j = 0; j <= N; j++) {
            if (idx <= j) {
                chmin(dp[i + 1][j], dp[i][j]);
                continue;
            }
            ll left = bt.sum(j, idx);
            chmin(dp[i + 1][idx + 1], dp[i][j] + left * A);
            if (left == 0) chmin(dp[i + 1][j], dp[i][j]);
            else chmin(dp[i + 1][j], dp[i][j] + B);
        }
        bt.add(idx, -1);
    }
    cout << *min_element(dp[N], dp[N] + SIZE) << endl;
    return 0;
}


Measured memory_bytes: 196480