Submission #1117228

#TimeUsernameProblemLanguageResultExecution timeMemory
1117228fdnfksdHolding (COCI20_holding)C++14
55 / 110
14 ms8784 KiB
#include <iostream> using namespace std; int n,l,r,K,a[105],dp[105][105][2505]={0},res=0; int main() { cin>>n>>l>>r>>K; for (int i=1; i<=n; i++) cin>>a[i]; for (int i=1; i<=l-1; i++) for (int j=l; j<=r; j++) for (int k=0; k<=K; k++) { dp[i][j][k]=min(dp[i-1][j][k],dp[i][j-1][k]); if(k>=abs(i-j)) dp[i][j][k]=min(dp[i][j][k],dp[i-1][j-1][k-abs(i-j)]-a[j]+a[i]); } int mn=0; for (int i=0; i<=K; i++) mn=min(mn,dp[l-1][r][i]); for (int i=l; i<=r; i++) res+=a[i]; cout<<res+mn; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...