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
#include <iostream>
#include <vector>
using namespace std;
using pii = pair<long long, long long>;
const long long MAXN = 300005;
vector<long long> T[MAXN];
long long DP[MAXN];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    long long n, m, k;
    cin >> n >> m >> k;
    for (long long i = 0; i < n; i++)
    {
        long long sum = 0;
        for (long long j = 0; j < m; j++)
        {
            long long c;
            cin >> c;
            sum += c;
            T[i].push_back(sum);
        }
    }
    for (long long i = 0; i < n; i++)
    {
        for (long long j = k; j >= 0; j--)
        {
            for (long long k = 1; k <= m && j - k >= 0; k++)
            {
                DP[j] = max(DP[j], DP[j - k] + T[i][k - 1]);
            }
        }
    }
    // for (long long i = 0; i <= k; i++)
    // cerr << "DP[" << i << "] = " << DP[i] << endl;
    // cerr << endl;
    cout << DP[k] << endl;
}