Submission #100312

#TimeUsernameProblemLanguageResultExecution timeMemory
100312tpoppoSličice (COCI19_slicice)C++14
63 / 90
1082 ms1400 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 500; int n,m,k; int b[MAXN]; int v[MAXN]; int dp[MAXN][MAXN]; int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> n >> m >> k; for(int i=0;i<n;i++) cin >> v[i]; for(int i=0;i<=m;i++) cin >> b[i]; for(int i=0;i<n;i++){ for(int t=0;t<=k;t++){ //cout<<dp[i][t]<<" "; for(int j=0;j + v[i] <= m && j <= t;j++){ dp[i+1][t-j] = max(dp[i+1][t - j], dp[i][t] + b[v[i] + j] ); } }//cout<<endl; } int rs = 0; for(int i=0;i<=m;i++) rs = max(rs,dp[n][i]); // cout<<i<<": "<<dp[n][i]<<'\n'; cout<<rs<<'\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...