# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
173701 | itgl | K blocks (IZhO14_blocks) | C++14 | 631 ms | 43084 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 pb push_back
using namespace std;
int n, k;
int a[100005];
int dp[100005][105];
int main(){
cin >> n >> k;
int sum=0;
for(int i=1;i<=n;i++){
cin >> a[i];
sum+=a[i];
}
memset(dp,1e9+7,sizeof(dp));
dp[0][1]=0;
for(int i=1;i<=n;i++){
dp[i][1]=max(dp[i-1][1],a[i]);
}
dp[0][1]=1e9+7;
for(int i=2;i<=k;i++){
stack<int> pval, val;
for(int j=1;j<=n;j++){
int x = dp[j-1][i-1];
while(!pval.empty()&&a[pval.top()]<a[j]){
x=min(x,val.top());
pval.pop();
val.pop();
# | 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... |