Submission #224945

#TimeUsernameProblemLanguageResultExecution timeMemory
224945VEGAnnSličice (COCI19_slicice)C++14
0 / 90
59 ms1532 KiB
#include <bits/stdc++.h> #define all(x) x.begin(),x.end() using namespace std; const int N = 510; int n, m, k, b[N], p[N], f[N][N]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m >> k; for (int i = 0; i < n; i++) cin >> p[i]; for (int i = 0; i <= m; i++) cin >> b[i]; for (int i = 0; i <= n; i++) for (int j = 0; j <= k; j++) f[i][j] = -1; f[0][0] = 0; for (int i = 0; i < n; i++) for (int j = 0; j <= k; j++){ if (f[i][j] < 0) continue; for (int z = 0; z + j <= k && z + p[i] <= m; z++) f[i + 1][j + z] = max(f[i + 1][j + 1], f[i][j] + b[p[i] + z]); } cout << f[n][k]; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...