提出 #17841248

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

int main()
{
    static const int ub = 1e+9 + 1;
    int N, M;
    cin >> N >> M;
    vector<int> D_vec(N), C_vec(M);
    for (int i = 0; i < N; ++i)
        cin >> D_vec.at(i);
    for (int j = 0; j < M; ++j)
        cin >> C_vec.at(j);
    vector<vector<int>> dp(N + 1, vector<int>(M + 1, ub));
    dp[0][0] = 0;
    for (int j = 0; j < M; ++j) {
        for (int i = 0; i < N; ++i)
            dp[i + 1][j + 1] = dp[i][j] + D_vec.at(i) * C_vec.at(j);
        for (int i = 0; i < N + 1; ++i) {
            int cost = dp[i][j];
            if (dp[i][j + 1] > cost)
                dp[i][j + 1] = cost;
        }
    }
    cout << dp[N][M] << endl;
}

提出情報

ジャッジ結果