HDU-1078FatMouse and Cheese 记忆化搜索

FatMouse and Cheese

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10996    Accepted Submission(s): 4668

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. 

 

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. 

 

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<algorithm>
#include<string.h>
using namespace std;
int n,m,a[105][105],c[4][2]={{0,-1},{-1,0},{0,1},{1,0}},dp[105][105];//dp数组存的是从当前点出发拿到的数量最多的值
bool f(int x,int y)/判断
{
	if(x>=1&&x<=n&&y>=1&&y<=n)
	return true;
	else
	return false;
}
int dfs(int x,int y)
{
	int x1,y1,ans=0,i,j;
	if(dp[x][y]>0)//已经计算过不再计算
	return dp[x][y];
		for(j=1;j<=m;j++)//放内放外都一样
		{
			for(i=0;i<=3;i++)
	       {
			x1=x+c[i][0]*j;
		    y1=y+c[i][1]*j;
			if(f(x1,y1)&&a[x1][y1]>a[x][y])
			{
         		ans=max(ans,dfs(x1,y1));//每次找最大的
			}
		}
	}
	dp[x][y]=a[x][y]+ans;
	return dp[x][y];
}
int main()
{
	while(~scanf("%d%d",&n,&m)&&n!=-1)
	{
		for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
		scanf("%d",&a[i][j]);
		memset(dp,0,sizeof(dp));
		printf("%d\n",dfs(1,1));
	}
}