1121 纪念品

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std ;
const int MAXN = 1e4 + 5 ;
int T, n, m, dp[MAXN], s[105][105];
int main()
{
	scanf("%d%d%d", &T, &n, &m) ;
	for(int i = 1; i <= T; i ++)
	{
		for(int j = 1; j <= n; j ++)
		{
			scanf("%d", &s[i][j]) ; 
		}
	}
	for(int i = 1; i < T; i ++)
	{
		int nm = 0 ;
		for(int j = 1; j <= n; j ++)
		{
			for(int k = s[i][j]; k <= m; k ++)
			{
				dp[k] = max(dp[k], dp[k - s[i][j]] + s[i + 1][j] - s[i][j]) ;
				nm = max(nm, dp[k]) ;
			}
		}
		memset(dp, 0, sizeof(dp)) ; 
		m += nm ; 
	} 
	printf("%d", m) ;
} 



/**
* @runId: 474330
* @language: C++
* @author: 15840031201
* @submitTime: 2023-08-05 17:15:10
*/

/**
* @runId: 2021559
* @language: C++
* @author: 13840002072
* @submitTime: 2024-01-25 16:16:19
*/

 各位给点个赞，评个论！！！