# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
994423 | TranThuMinh | K blocks (IZhO14_blocks) | C++17 | 170 ms | 84676 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>
#define int long long
#define pi pair<int, int>
using namespace std;
const int N = 1e5 + 5,
K = 105,
INF = 1e17;
int n, k;
int a[N];
int f[N][K];
signed main() {
cin.tie(0)->sync_with_stdio(0);
if(fopen("task.inp", "r")) {
freopen("task.inp", "r", stdin);
freopen("task.out", "w", stdout);
}
cin >> n >> k;
for(int i = 1; i <= n; ++i) cin >> a[i];
for(int i = 0; i <= n; ++i)
for(int j = 0; j <= k; ++j) f[i][j] = INF;
f[1][1] = a[1];
for(int i = 2; i <= n; ++i) f[i][1] = max(f[i - 1][1], a[i]);
for(int j = 2; j <= k; ++j) {
stack<pi> st;
for(int i = j; i <= n; ++i) {
int dp = f[i - 1][j - 1];
while(st.size() && a[st.top().second] <= a[i]) dp = min(dp, st.top().first), st.pop();
f[i][j] = min(f[i][j], dp + a[i]);
f[i][j] = min(f[i][j], f[st.size() ? st.top().second : 0][j]);
st.push({dp, i});
}
}
cout << f[n][k];
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |