zoukankan      html  css  js  c++  java
  • 1708-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. 
     

    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 <stdlib.h> #include <string.h> int arry[101][101]; int dp[101][101]; int n,k; int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}}; int dfs(int x,int y) { int dx,dy; int max=0; int temp; int i,j; if(dp[x][y]>0) return dp[x][y]; for(i=0;i<4;i++) { for(j=1;j<=k;j++) { dx=x+dir[i][0]*j; dy=y+dir[i][1]*j; if(dx>=0&&dx<n&&dy>=0&&dy<n&&arry[x][y]<arry[dx][dy]) { temp=dfs(dx,dy); if(max<temp) max=temp; } } } dp[x][y]=max+arry[x][y]; return dp[x][y]; } int main(int argc, char const *argv[]) { int i,j; while(scanf("%d%d",&n,&k),k!=-1) { memset(dp,0,sizeof(dp)); for(i=0;i<n;i++) for(j=0;j<n;j++) scanf("%d",&arry[i][j]); dfs(0,0); printf("%d ",dp[0][0]); } return 0; }
  • 相关阅读:
    Activity 生命周期 返回键 退出 杂谈
    多线程基本语法
    常用代码
    JSP 相关
    powerDesiger uml class
    抽象类的说明
    javaScript 中常用的正则表达式
    chickbox 的使用
    对象在内存中的状态
    jQuery 常用代码
  • 原文地址:https://www.cnblogs.com/kuroko-ghh/p/9363358.html
Copyright © 2011-2022 走看看