# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42264 | RezwanArefin01 | Stove (JOI18_stove) | C++14 | 49 ms | 47724 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int a[5001], n, K, dp[5001][5001];
int main(int argc, char const *argv[]) {
scanf("%d %d", &n, &K);
for(int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for(int i = 1; i <= n; i++)
dp[1][i] = a[i] - a[1] + 1;
for(int k = 2; k <= K; k++) {
int Min = 1e9;
for(int i = 1; i <= n; i++) {
dp[k][i] = a[i] + Min + 1;
if(i < n) Min = min(Min, dp[k - 1][i] - a[i + 1]);
}
}
cout << dp[K][n] << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |