Submission #1239123

#TimeUsernameProblemLanguageResultExecution timeMemory
1239123MasterDebaterK blocks (IZhO14_blocks)C++20
53 / 100
1101 ms82588 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long const ll INF=1e18; ll n,k,a[100005],dp[100005][105]; ll solve(int i,int j){ if(j>k)return INF; if(i==n){ if(j==k)return 0; return INF; } if(dp[i][j]==-1){ dp[i][j]=1e9; ll mx=0; for(int q=i;q<n;q++){ mx=max(mx,a[q]); dp[i][j]=min(dp[i][j],mx+solve(q+1,j+1)); } } return dp[i][j]; } int main(){ cin>>n>>k; for(int i=0;i<n;i++)cin>>a[i]; for(int i=0;i<100005;i++)for(int j=0;j<105;j++)dp[i][j]=-1; cout<<solve(0,0); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...