CCC 2007 S5 Bowling for Numbers

    1#include <bits/stdc++.h>
    2using namespace std;
    3using ll = long long;
    4const int inf = 1e9;
    5const long long INF = 1e17; //❄️
    6void solve() {
    7    int n, k, w; cin >> n >> k >> w;
    8    vector<int> psa(n + 1);
    9    for (int i = 1; i <= n; i++) {
    10        int x; cin >> x;
    11        psa[i] = psa[i - 1] + x;
    12    }
    13    vector<vector<int>> dp(k + 1, vector<int>(n + 1));
    14    for (int i = 0; i <= k; i++) dp[i][0] = 0;
    15    for (int i = 1; i <= k; i++) {
    16        for (int j = 1; j <= n; j++) {
    17            dp[i][j] = max(dp[i][j - 1], dp[i - 1][max(0, j - w)] + psa[j] - psa[j - w >= 0 ? j - w : j]);
    18        }
    19    }
    20    cout << dp[k][n] << '\n';
    21}
    22int main() {
    23    ios::sync_with_stdio(0); cin.tie(0); 
    24    int t; cin >> t;
    25    while (t--) {
    26        solve();
    27    }
    28    return 0;
    29}