hdoj-1078 FatMouse and Cheese（dp）

FatMouse and Cheese

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

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
  
  

 

题目链接

从(x1,y1)到(x2,y2)满足(x1==x2)&& |y1-y2|<=k  或者 |x1-x2|<=k && (y1==y2);

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
int map[110][110];
int dp[110][110];
int n,m,k;
int dfs(int p,int q)
{
    if(!dp[p][q])
    {
        int i,j;
        int ans,maxn=0;
        int left,right,down,up;
        left=p-k;        //每一个操作不能超过K步
        right=p+k;
        if(left<0)  //防止越界
            left=0;
        if(right>=n) right=n-1;
        for(i=left; i<=right; i++)
        {
            if(map[i][q]>map[p][q]) //条件要求下一步必须比前一步的值大
            {
                ans=dfs(i,q);
                if(maxn<ans)
                    maxn=ans;
            }
        }
        up=q-k;
        down=q+k;
        if(up<0)
            up=0;
        if(down>=n)
            down=n-1;
        for(i=up; i<=down; i++)
        {
            if(map[p][i]>map[p][q])
            {
                ans=dfs(p,i);
                if(maxn<ans)
                    maxn=ans;
            }
        }
        dp[p][q]=maxn+map[p][q];    //状态转移方程 DP[p][q]=max(dp[i][q],dp[p][j])+map[p][q]  其中i就是左右，j是上下
    }
    return dp[p][q];
}
int main()
{
    int i,j;
    while(1)
    {
        scanf("%d%d",&n,&k);
        if(n==-1&&k==-1)
            break;
        for(i=0; i<n; i++)
        {
            for(j=0; j<n; j++)
                cin>>map[i][j];
        }
        memset(dp,0,sizeof(dp));
        printf("%d\n",dfs(0,0));
    }
    return 0;
}