Submission #1285961

#TimeUsernameProblemLanguageResultExecution timeMemory
1285961harryleeeStove (JOI18_stove)C++20
50 / 100
156 ms327680 KiB
#include<bits/stdc++.h> using namespace std; int n, k, a[100001]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> k; for (int i = 1; i <= n; ++i){ cin >> a[i]; } vector<vector<long long>> dp(n + 1, vector<long long> (k + 1, 1e18)); dp[0][0] = 0; for (int i = 1; i <= n; ++i){ for (int j = 1; j <= k; ++j){ dp[i][j] = min({dp[i][j], dp[i - 1][j] + a[i] - a[i - 1], dp[i - 1][j - 1] + 1}); //cout << dp[i][j] << " "; } //cout << "\n"; } long long res = 1e18; for (int i = 1; i <= k; ++i) res = min(res, dp[n][i]); cout << res; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...