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

using namespace std;

typedef long long ll;

int n, m, k;
ll sp[300001];
ll dp[300001];
ll prevdp[300001];

int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  cin >> n >> m >> k;
  for (int i = 0; i < n; i++)
  {
    for (int j = 1; j <= m; j++)
    {
      cin >> sp[j];
      sp[j] += sp[j-1];
    }
    for (int j = 0; j <= k; j++)
    {
      for (int o = 0; o <= min(j, m); o++)
        dp[j] = max(dp[j], sp[o] + prevdp[j-o]);
    }
    for (int j = 0; j <= k; j++) prevdp[j] = dp[j];
  }
  cout << dp[k] << '\n';

  return 0;
}