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
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    long long k;
    cin >> n >> m >> k;

    vector<vector<long long>> stacks(n, vector<long long>(m));
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            cin >> stacks[i][j];

    vector<long long> dp(k+1, LLONG_MIN);
    dp[0] = 0;

    for (int i = 0; i < n; i++) {
        vector<long long> prefix(1, 0);
        long long sum = 0;
        for (int j = 0; j < m && j < k; j++) { // ograniczamy do k
            sum += stacks[i][j];
            prefix.push_back(sum);
        }

        vector<long long> new_dp = dp;

        for (int x = 0; x <= k; x++) {
            for (int j = 1; j < prefix.size() && j <= x; j++) {
                if (dp[x-j] != LLONG_MIN)
                    new_dp[x] = max(new_dp[x], dp[x-j] + prefix[j]);
            }
        }

        dp = move(new_dp);
    }

    cout << dp[k] << "\n";
    return 0;
}