ZOJ 1107 FatMouse and Cheese

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=107

FatMouse and Cheese

---

Time Limit: 10 Seconds      Memory Limit: 32768 KB

---

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 Specification

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 Specification

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

Output for Sample Input

37

题目大意：给你n*n的网格，每个网格有个值，现从（0,0）点出发，每步最多可以走k个格子，而且下一个格子的值一定要比这个格子的值大。求能走的路径值的最大和。

直接DP不好搞，只能借助DFS再DP。比较简单 啦，我就不多解释了，直接上AC的代码。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<sstream>
#include<vector>
#include<map>
#include<stack>
#include<list>
#include<set>
#include<queue>
#define LL long long
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1 | 1
using namespace std;
const int maxn=1005,maxe=100005,inf=1<<29;
int n,m,Map[maxn][maxn],dp[maxn][maxn];
int dir[][2]={
{0,1},{-1,0},{0,-1},{1,0}
};
int dfs(int x,int y)
{
    if(dp[x][y]!=-1) return dp[x][y];//计算过了直接返回
    int Max=0;
    for(int k=1;k<=m;k++)//分别枚举一步走1~k个格子
    for(int i=0;i<4;i++)
    {
        int nx=dir[i][0]*k+x,ny=dir[i][1]*k+y;
        if(nx>=0&&nx<n&&ny>=0&&ny<n&&Map[x][y]<Map[nx][ny])
        {
            dp[nx][ny]=dfs(nx,ny);
            //printf("%d\n",dp[nx][ny]);
            if(dp[nx][ny]>Max) Max=dp[nx][ny];//更新这个点出发能走出的最大值
        }
    }
    return Max+Map[x][y];
}
int main()
{
    while(~scanf("%d%d",&n,&m)&&!(n==-1||m==-1))
    {
        for(int i=0;i<n;i++)
            for(int j=0;j<n;j++)
            scanf("%d",&Map[i][j]);
        memset(dp,-1,sizeof(dp));
        printf("%d\n",dfs(0,0));
    }
    return 0;
}