#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
vector <int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
vector <int> b(m + 1);
for (int i = 0; i <= m; i++) {
cin >> b[i];
}
vector <ll> dp(k + 1, 0);
for (int i = 0; i < n; i++) {
vector <ll> go(k + 1, 0);
for (int j = 0; j <= k; j++) {
for (int x = 0; x <= k; x++) {
if (x > j) break;
int add = j - x;
if (p[i] + add > m) continue;
go[j] = max(go[j], dp[x] + b[p[i] + add]);
}
}
dp = go;
}
ll ans = 0;
for (int i = 0; i <= k; i++) {
ans = max(ans, dp[i]);
}
cout << ans << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
130 ms |
504 KB |
Output is correct |
4 |
Correct |
135 ms |
388 KB |
Output is correct |
5 |
Correct |
128 ms |
504 KB |
Output is correct |
6 |
Correct |
129 ms |
476 KB |
Output is correct |
7 |
Correct |
121 ms |
384 KB |
Output is correct |
8 |
Correct |
133 ms |
384 KB |
Output is correct |
9 |
Correct |
123 ms |
388 KB |
Output is correct |
10 |
Correct |
136 ms |
424 KB |
Output is correct |