多阶段的决策问题,肯定是记忆化搜索了
设 d ( i , j , d i r ) d(i,j,dir) d(i,j,dir)为在坐标 ( i , j ) (i,j) (i,j)处向 d i r dir dir方向走出的最长路,然后有:
d ( i , j , d i r ) = m a x ( d ( i + d x , j + d y , k ) ) , a [ i ] [ j ] > a [ i + d x ] [ j + d y ] , 0 < k < 4 d(i,j,dir)=max(d(i+dx,j+dy,k)),a[i][j]>a[i+dx][j+dy],0<k<4 d(i,j,dir)=max(d(i+dx,j+dy,k)),a[i][j]>a[i+dx][j+dy],0<k<4
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <math.h>
#include <cstdio>
#include <string>
#include <bitset>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define ins insert
#define lowbit(x) (x&(-x))
#define mkp(x,y) make_pair(x,y)
#define mem(a,x) memset(a,x,sizeof a);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> P;
const double eps=1e-8;
const double pi=acos(-1.0);
const int inf=0x3f3f3f3f;
const ll INF=1e18;
const int Mod=1e9+7;
const int maxn=105;
const int dx[]={0,0,1,-1},dy[]={1,-1,0,0};
int a[maxn][maxn],d[maxn][maxn][4];
char s[maxn];
int r,c;
int dp(int x,int y,int dir){
int &ans=d[x][y][dir];
if(ans>0) return ans;
ans=1;
for(int i=0;i<4;i++){
int xx=x+dx[i],yy=y+dy[i];
if(xx<0 || xx>=r || yy<0 || yy>=c) continue;
if(a[x][y]>a[xx][yy])
ans=max(ans,dp(xx,yy,i)+1);
}
return ans;
}
int main(){
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
//ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int t;
scanf("%d",&t);
while(t--){
scanf("%s%d%d",s,&r,&c);
for(int i=0;i<r;i++)
for(int j=0;j<c;j++)
scanf("%d",&a[i][j]);
memset(d,0,sizeof d);
int ans=0;
for(int i=0;i<r;i++)
for(int j=0;j<c;j++)
for(int k=0;k<4;k++)
ans=max(ans,dp(i,j,k));
printf("%s: %d\n",s,ans);
}
return 0;
}