Submission #996465

#	Time	Username	Problem	Language	Result	Execution time	Memory
996465		overwatch9	Stove (JOI18_stove)	C++17	20 / 100	1016 ms	119640 KiB

stove

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
int N, K;
vector <int> t;
const int maxn = 5000 + 1;
ll dp[maxn][maxn];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> N >> K;
    t.resize(N+1);
    for (int i = 1; i <= N; i++)
        cin >> t[i];
    ll ans = 1e18;
    for (int i = 0; i <= N; i++) {
        fill(dp[i], dp[i] + maxn, 1e18);
    }
    dp[0][0] = 0;
    for (int j = 1; j <= N; j++) {
        for (int k = 1; k <= K; k++) {
            for (int i = j; i <= N; i++) {
                dp[i][k] = min(dp[i][k], dp[j-1][k-1] + t[i] - t[j] + 1);
                if (i == N)
                    ans = min(ans, dp[i][k]);
            }
        }
    }
    cout << ans << '\n';
}

• Subtask 1: 20 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 50