# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671899 | Baytoro | K blocks (IZhO14_blocks) | C++17 | 36 ms | 82528 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;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
void fopn(string name){
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
const int INF=1e18,mod=1e9+7;
int n,k;
int dp[100005][105],a[100005],mx[100005][105],cnt[100005][105];
void solve(){
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>a[i];
memset(dp,0x3f3f3f3f,sizeof(dp));
dp[0][0]=0;
for(int j=1;j<=k;j++){
for(int i=j;i<=n;i++){
dp[i][j]=dp[i-1][j-1]+a[i];
mx[i][j]=a[i];
cnt[i][j]=1;
int x=dp[i-1][j]-mx[i-1][j];
x+=max(mx[i-1][j],a[i]);
if(dp[i][j]>x){
dp[i][j]=x;
mx[i][j]=max(mx[i-1][j],a[i]);
}
/*if(dp[i][j]>dp[i-1][j]-mx[i-1][j]+max(mx[i-1][j],a[i])){
dp[i][j]=dp[i-1][j]-mx[i-1][j]+max(mx[i-1][j],a[i]);
mx[i][j]=max(mx[i-1][j],a[i]);
}*/
}
}
cout<<dp[n][k];
}
main(){
ios;
int T=1;
//cin>>T;
while(T--){
solve();
}
}
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... |