HDU - 2182 Frog(01背包)

[code]#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 110;

int n, a, b, k;
int num
;
int dp

;
void init() {
    scanf("%d%d%d%d", &n, &a, &b, &k);

    memset(num, 0, sizeof(num));
    int t;
    for (int i = 1; i <= n; i++) 
        scanf("%d", &num[i]);

}

void solve() {
    memset(dp, 0, sizeof(dp));
    dp[1][0] = num[1]; 

    for (int i = 1; i <= k; i++)
        for (int j = n; j >= 1; j--) { 
            dp[j][i] = dp[j][i - 1];
            if (j > a) {
                for (int l = a; l <= b; l++) 
                    if (j > l)  dp[j][i] = max(dp[j][i], dp[j - l][i - 1] + num[j]);
            }
        }

    int ans = 0;
    for (int i = 0; i <= n; i++) 
        ans = max(ans, dp[i][k]);

    printf("%d\n", ans);
}

int main() {
    int test;
    scanf("%d", &test);
    while (test--) {
        init();
        solve();
    }
    return 0;
}