# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168067 | GioChkhaidze | K blocks (IZhO14_blocks) | C++14 | 246 ms | 42872 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 F first
#define S second
using namespace std;
const int N=1e5+5,K=105;
int n,k;
int a[N],dp[N][K];
stack < pair < int , int > > st ;
main ( ){
scanf("%d%d",&n,&k);
for (int i=1; i<=n; i++) {
scanf("%d",&a[i]);
dp[i][1]=max(dp[i-1][1],a[i]);
}
for (int j=2; j<=k; j++) {
while (st.size()) st.pop();
for (int i=j; i<=n; i++) {
int h=a[i],up=dp[i-1][j-1];
while (st.size() && st.top().F<=h) { up=min(up,st.top().S); st.pop(); }
if (!st.size() || st.top().F+st.top().S>=up+h) st.push({h,up});
dp[i][j]=st.top().F+st.top().S;
}
}
printf("%d\n",dp[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... |