dp+搜索-1

#include<bits/stdc++.h>
using namespace std;
int a[55][55],c[55][55][15][15];
int n,m,k;
const int mod=1000000007;
int dfs(int x,int y,int num,int value)
{
    if(c[x][y][num][value]!=-1) return c[x][y][num][value];
    if(x==n&&y==m)
    {
        if(num==k||num==k-1&&a[x][y]>value) return c[x][y][num][value]=1;
        return c[x][y][num][value]=0;
    }
    int t=0;
    if(x+1<=n)
    {
        t=(t+dfs(x+1,y,num,value))%mod;
        if(a[x][y]>value) t=(t+dfs(x+1,y,num+1,a[x][y]))%mod;
    }
    if(y+1<=m)
    {
        t=(t+dfs(x,y+1,num,value))%mod;
        if(a[x][y]>value) t=(t+dfs(x,y+1,num+1,a[x][y]))%mod;
    }
    return c[x][y][num][value]=t;
}
int main()
{
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=n;i++)
     for(int j=1;j<=m;j++)
      {
          scanf("%d",&a[i][j]);
          a[i][j]++;
      }
      memset(c,-1,sizeof(c));
      printf("%d\n",dfs(1,1,0,0));
    return 0;
}

地宫取宝