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. Input There are several test cases. Each test case consists of Output For each test case output in a line the single integer giving the number of blocks of cheese collected.
就是它只能走x、y轴,一次可以走1-k步,下一步可吃的事物要大于上一步的,求最大的吃的东西的量。 |
#include <iostream>
#include <cstdio>
#include <cstring>
#define N 105
using namespace std;
int n,k;
int data[N][N],dp[N][N];
int tab[4][2]={1,0,-1,0,0,1,0,-1};//该表表示搜索的方向
int dfs(int x,int y)
{
int maxn=0,t,x1,y1;
if(dp[x][y]==0)//未被搜索过的点
{
for(int i=1;i<=k;i++)
{
for(int j=0;j<4;j++)
{
x1=x+tab[j][0]*i;
y1=y+tab[j][1]*i;
if(x1>=0&&x1<n&&y1>=0&&y1<n&&data[x1][y1]>data[x][y])//被搜索的点在网格中且符合条件
{
t=dfs(x1,y1);//继续搜索
maxn=max(maxn,t);//取最大值
}
}
}
dp[x][y]=maxn+data[x][y];//记忆化,储存每一个节点的最大值;
}
return dp[x][y];
}
int main()
{
int i,j;
while(scanf("%d%d",&n,&k))
{
if(n<=0) break;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
scanf("%d",&data[i][j]);
memset(dp,0,sizeof(dp));
printf("%d\n",dfs(0,0));//最大值;
}
return 0;
}
dp做法:
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<iostream>
using namespace std;
const int MAXN=110;
int a[MAXN][MAXN];
int dp[MAXN][MAXN]; ///dp[i][j]是在i j点所能获得的最大的值
struct Node
{
int x,y,val;
}node[MAXN*MAXN];
bool cmp(Node a,Node b)
{
return a.val<b.val;
}
int main()
{
int n,k;
while(scanf("%d%d",&n,&k)==2)
{
if(n==-1&&k==-1)break;
int cnt=0;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
if(i!=0||j!=0)
{
node[cnt].x=i;
node[cnt].y=j;
node[cnt++].val=a[i][j];
}
}
sort(node,node+cnt,cmp); ///这对于搜索转dp问题很关键,因为这里只能从小的向大的走,所以先更新当前格子val,
///这样后面用到当前位置的dp[][]时候就已经有值了,很巧妙,没有这层限制关系(从小到大)
///是转不成DP的!!!
memset(dp,-1,sizeof(dp));
dp[0][0]=a[0][0];
int ans=dp[0][0];
for(int i=0;i<cnt;i++)
{
int x=node[i].x;
int y=node[i].y;
for(int xx=max(0,x-k);xx<=min(n-1,x+k);xx++) ///左右方向DP
{
if(a[xx][y]>=a[x][y])continue;
if(dp[xx][y]==-1)continue; ///虽然满足了从小到大限制条件,能从(xx,y)到当前位置,但是(xx,y)位置都是没法进入
///也就最终无法从(xx,y)到当前位置了
dp[x][y]=max(dp[x][y],dp[xx][y]+a[x][y]);
// cout<<i<<" "<<dp[x][y]<<endl;
}
for(int yy=max(0,y-k);yy<=min(n-1,y+k);yy++) ///上下方向DP
{
if(a[x][yy]>=a[x][y])continue;
if(dp[x][yy]==-1)continue; ///虽然满足了从小到大限制条件,能从(xx,y)到当前位置,但是(xx,y)位置都是没法进入
///也就最终无法从(xx,y)到当前位置了
dp[x][y]=max(dp[x][y],dp[x][yy]+a[x][y]);
//cout<<i<<" "<<dp[x][y]<<endl;
}
ans=max(ans,dp[x][y]);
}
printf("%d\n",ans);
}
return 0;
}