FatMouse and Cheese
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Problem Description
FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At each grid location Fatmouse has hid between 0 and 100 blocks of cheese in a hole. Now he's going to enjoy his favorite food.
FatMouse begins by standing at location (0,0). He eats up the cheese where he stands and then runs either horizontally or vertically to another location. The problem is that there is a super Cat named Top Killer sitting near his hole, so each time he can run at most k locations to get into the hole before being caught by Top Killer. What is worse -- after eating up the cheese at one location, FatMouse gets fatter. So in order to gain enough energy for his next run, he has to run to a location which have more blocks of cheese than those that were at the current hole.
Given n, k, and the number of blocks of cheese at each grid location, compute the maximum amount of cheese FatMouse can eat before being unable to move.
FatMouse begins by standing at location (0,0). He eats up the cheese where he stands and then runs either horizontally or vertically to another location. The problem is that there is a super Cat named Top Killer sitting near his hole, so each time he can run at most k locations to get into the hole before being caught by Top Killer. What is worse -- after eating up the cheese at one location, FatMouse gets fatter. So in order to gain enough energy for his next run, he has to run to a location which have more blocks of cheese than those that were at the current hole.
Given n, k, and the number of blocks of cheese at each grid location, compute the maximum amount of cheese FatMouse can eat before being unable to move.
Input
There are several test cases. Each test case consists of
a line containing two integers between 1 and 100: n and k
n lines, each with n numbers: the first line contains the number of blocks of cheese at locations (0,0) (0,1) ... (0,n-1); the next line contains the number of blocks of cheese at locations (1,0), (1,1), ... (1,n-1), and so on.
The input ends with a pair of -1's.
a line containing two integers between 1 and 100: n and k
n lines, each with n numbers: the first line contains the number of blocks of cheese at locations (0,0) (0,1) ... (0,n-1); the next line contains the number of blocks of cheese at locations (1,0), (1,1), ... (1,n-1), and so on.
The input ends with a pair of -1's.
Output
For each test case output in a line the single integer giving the number of blocks of cheese collected.
Sample Input
3 1
1 2 5
10 11 6
12 12 7
-1 -1
Sample Output
37
#include <stdio.h> #include <memory.h> #define M 101 int n;//地图大小 int k;//一步最多走的距离 int direction[4][2] = {//地图中的四个方向 {1, 0}, {-1, 0}, {0, 1}, {0, -1} }; int map[M][M];//存放地图中的数据 int max[M][M];//存放相应位置能得到的最多奶酪数量 int inarea(int x, int y) {//判断是否越界 return x >= 0 && y >= 0 && x < n && y<n; } int dp(int x, int y) { //DP函数 int mtmp = 0;//用来暂时存放该位置所能得到的奶酪数量 for (int lenth = 1; lenth <= k; lenth++) { for (int i = 0; i < 4; i++) { if (inarea(x + direction[i][0] * lenth, y + direction[i][1] * lenth)//判断是否满足条件 && map[x + direction[i][0] * lenth][y + direction[i][1] * lenth] > map[x][y]){ if(max[x + direction[i][0] * lenth][y + direction[i][1] * lenth] ==-1)//如果为-1说明没有对该位置进行DP max[x + direction[i][0] * lenth][y + direction[i][1] * lenth] =dp(x + direction[i][0] * lenth,y + direction[i][1] * lenth); if(max[x + direction[i][0] * lenth][y + direction[i][1] * lenth]>mtmp) mtmp = max[x + direction[i][0] * lenth][y + direction[i][1] * lenth]; } } } max[x][y] = map[x][y] + mtmp;//不要忘记加上该位置的奶酪数量 return max[x][y]; } int main(void) { while (scanf("%d%d", &n, &k) && n != -1) { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) scanf("%d", &map[i][j]);//读取地图 } memset(max, -1, sizeof (max));//数组初始化 printf("%d\n", dp(0, 0)); } return 0; }