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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include "bits/stdc++.h"
using namespace std;

const int MAX_K = 300001;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, m, k;
    long long a;
    vector<vector<long long>> pancakes;

    cin >> n >> m >> k;

    long long sum;
    long long result;

    for(int i=0; i<n; i++) {
        sum = 0;
        vector<long long> stack;
        for(int j=0; j<m; j++) {
            cin >> a;
            if(j < k) {
                sum += a;
                stack.push_back(sum);
            }
        }
        pancakes.push_back(stack);
    }

    long long array1[MAX_K];
    long long array2[MAX_K];
    long long* current  = array1;
    long long* previous  = array2;
    
    for(int i=0; i<=k; i++) {
        if(i == 0) {
            previous[0] = 0;
            continue;
        }
        if(i <= m) {
            previous[i] = pancakes[0][i-1];
        } else {
            previous[i] = previous[i-1];
        }
    }

    long long now;
    int pancake_index;
    int ps, cc;

    for(int i=1; i<n; i++) {
        int start_from = k - (m * (n - i - 1));
        if(start_from < 0) {
            start_from = 0;
        }
        for(int j=start_from; j<=k; j++) {
            long long best = previous[j];
            for(int p=j-1; p>=0; p--) {
                if(j-p-1 >= m) {
                    break;
                }
                now = previous[p] + pancakes[i][j-p-1];
                if(now > best) {
                    best = now;
                }
            }
            current[j] = best;
        }
        swap(current, previous);
    }

    result = previous[k];

    cout<<result<<"\n";

    return 0;
}