在m*n个方格中求走的路径的最大值

在n*m个方格中，m为奇数，放置有n*m个数，方格中间的下方有一人，此人可按照五个方向前进但不能越出方格。要求找到一条从低到顶的路径，使其基数相加和最大。 

#include<stdio.h>
#include<stdlib.h>
int main(void){
	int a[6][7] = {
		{ 16,4,3,12,6,0,3 },
		{ 4,-5,6,7,0,0,2 },
		{ 6,0,-1,-2,3,6,8 },
		{ 5,3,4,0,0,-2,7 },
		{ -1,7,4,0,7,-5,6 },
		{ 0,-1,3,4,12,4,2 }
	};

	int b[6][7], c[6][7];
	int i, j, k;
	int max;
	int flag;
	int temp;
	for (i = 0; i<6; i++)
		for (j = 0; j<7; j++){
			b[i][j] = a[i][j];
			c[i][j] = -1;
		}
	for (i = 1; i<5; i++){
		for (j = 0; j<7; j++){
			max = 0;
			for (k = j - 2; k <= j + 2; k++) {
				if (k<0)
					continue;
				else if (k>6)
						break;
					else{
						if (b[i][j] + b[i - 1][k]>max) {
							max = b[i][j] + b[i - 1][k]; flag = k;
						}
					}
			}
			b[i][j] = max;
			c[i][j] = flag;
		}
	}
	for (j = 1; j <= 5; j++){
		max = 0;
		for (k = j - 2; k <= j + 2; k++) {
			if (k<0)
				continue;
			else if (k>6)
					break;
				else{
					if (b[i][j] + b[i - 1][k]>max) {
						max = b[i][j] + b[i - 1][k]; flag = k;
					}
				}
		}
		b[i][j] = max;
		c[i][j] = flag;
	}
	max = 0;
	for (j = 1; j <= 5; j++){
		if (b[i][j]>max){
			max = b[i][j];
			flag = j;
		}
	}
	printf("最大值的和为：%d\n", max);
	printf("走过的数为:");
	temp = c[i][flag];
	printf("%5d", a[i][temp]); 
	for (j = i; j>0; j--){
		temp = c[j][temp];
		printf("%5d", a[j - 1][temp]);
	}
	printf("\n");
	system("pause");
	return 0;
}