zoukankan      html  css  js  c++  java
  • HDU

    FatMouse and Cheese

    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. 

    InputThere 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. 
    OutputFor 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<stdlib.h>
    #include<string.h>
    #include<math.h>
    #include<algorithm>
    #define MAX 105
    #define INF 0x3f3f3f3f
    #define MOD 1000000007
    using namespace std;
    typedef long long ll;
    
    int a[MAX][MAX];
    int dp[MAX][MAX];
    int t[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
    int n;
     
    int dfs(int x,int y,int s){
        int i,k;
        for(k=1;k<=s;k++){
            for(i=0;i<4;i++){
                int tx=x+t[i][0]*k;
                int ty=y+t[i][1]*k;
                if(tx<1||ty<1||tx>n||ty>n) continue;
                if(a[tx][ty]<=a[x][y]) continue;
                if(dp[tx][ty]>0) dp[x][y]=max(dp[x][y],dp[tx][ty]);
                else dp[x][y]=max(dp[x][y],dfs(tx,ty,s));
            }
        }
        dp[x][y]+=a[x][y];
        return dp[x][y];
    }
    int main()
    {
        int k,i,j;
        while(scanf("%d%d",&n,&k)&&n+k>0){
            for(i=1;i<=n;i++){
                for(j=1;j<=n;j++){
                    scanf("%d",&a[i][j]);
                }
            }
            memset(dp,0,sizeof(dp));
            printf("%d
    ",dfs(1,1,k));
        }
        return 0;
    }
  • 相关阅读:
    jquery笔记
    JavaScript 运动框架 Step by step(转)
    js中获取页面元素方法总结
    图片缩放效果IE和火狐兼容模式
    js循环运动效果实现
    网页捕捉错误
    (图文介绍)Virtualbox下实现Ubuntu虚拟机和win7主机文件共享(很简单,亲自试用,按此步骤一般都会成功)
    FFT算法实现(fft算法)快速傅里叶变换算法实现
    $_SESSION跨页面问题
    暂别ACM,转移阵地
  • 原文地址:https://www.cnblogs.com/yzm10/p/9362292.html
Copyright © 2011-2022 走看看