POJ 3230 Travel

n 个城市 逛m 天，从city i -> j  = cost[i][j], 第i 天在city j 的收入是 inc[i][j];求m天之后的最大收益，

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>

using namespace std;

#define N 105

int dp[N][N], cost[N][N], c[N][N];

int main()
{
	int n, m;
	while(~scanf("%d%d", &n, &m) && (n || m))
	{
		for( int i = 1; i <= n; i++ )
		{
			for(int j = 1; j <= n; j++ )
			{
				scanf("%d", &cost[i][j]);
			}
		}
		for( int i = 1; i <= m; i++ )
		{
			for( int j = 1; j <= n; j++ )
			{
				scanf("%d", &c[i][j]);
			}
		}
		
		memset(dp, 0, sizeof(dp));
		for (int i = 1; i <= n; i++)
			dp[1][i] = c[1][i] - cost[1][i];
			
		for ( int i = 2; i <= m; i++ )
		{
			for( int j = 1; j <= n; j++ )
			{
				for (int k = 1; k <= n; k++ )
				{
					//dp[i][j] = max(dp[i-1][j] - cost[j][j], dp[i-1][k] - cost[k][j]) + c[i][j];
					dp[i][j] = max(dp[i][j], dp[i-1][k] - cost[k][j] + c[i][j]);
				}
			}
		}
		int ans = 0;
	 	for ( int i = 1; i <= n; i++ )
	 	{
	 		ans = ans > dp[m][i] ? ans : dp[m][i];
	 	}
	 	printf("%d\n", ans);
	}
	return 0;
}