1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
|
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdlib>
using namespace std;
const int maxn = 25;
int dp[maxn][maxn];
int main() {
freopen("rockers.in", "r", stdin);
freopen("rockers.out", "w", stdout);
int n, t, m;
scanf("%d%d%d", &n, &t, &m);
for (int i = 1; i <= n; ++i) {
int x;
scanf("%d", &x);
for (int j = m; j >= 1; --j) {
for (int k = 0; k <= t; ++k) {
if (k < x) {
if (t >= x && j < m) {
dp[j + 1][t - x] = max(dp[j + 1][t - x], dp[j][k] + 1);
}
} else {
dp[j][k - x] = max(dp[j][k - x], dp[j][k] + 1);
}
}
}
}
int ans = 0;
for (int i = 1; i <= m; ++i) {
for (int j = 0; j < t; ++j) {
ans = max(ans, dp[i][j]);
}
}
printf("%d\n", ans);
return 0;
}
|