# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
84672 | farukkastamonuda | K blocks (IZhO14_blocks) | C++14 | 171 ms | 51712 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 fi first
#define se second
#define mp make_pair
#define lo long long
#define inf 1000000000
#define md 1000000007
#define pb push_back
#define li 100005
#define ii pair<int,int>
using namespace std;
int n,k,A[li],dp[105][li];
deque< pair<int,int> > q;
int main(){
scanf("%d %d",&n,&k);
for(int i=1;i<=n;i++){
scanf("%d",&A[i]);
}
for(int i=0;i<=k;i++){
for(int j=0;j<=n;j++){
dp[i][j]=inf;
}
}
dp[0][0]=0;
for(int i=1;i<=k;i++){
q.clear();
for(int j=1;j<=n;j++){
if(i>j){
dp[i][j]=inf;
continue;
}
int s=dp[i-1][j-1];
while(!q.empty() && q.front().fi<=A[j]){
s=min(s,q.front().se);
q.pop_front();
}
if(!q.empty() && q.front().fi+q.front().se<=s+A[j]){
dp[i][j]=q.front().fi+q.front().se;
}
else{
dp[i][j]=s+A[j];
q.push_front(mp(A[j],s));
}
}
}
printf("%d\n",dp[k][n]);
return 0;
}
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... |