$在迷宫中移动有上下左右四种方式$
这好像不能用过河卒那样的dp解
by Cuber_release @ 2023-11-26 15:31:26
```cpp
for(int i = 1;i<=n;i++)
{
for(int j = 1;j<=m;j++)
{
dp[i][j] = dp[i-1][j]+dp[i][j-1];
if(a[i-1][j]==-1)
{
dp[i][j]+=1;
}
if(a[i][j-1]==-1)
{
dp[i][j]+=1;
}
}
}
```
这段代码只考虑了向右和向下
by Cuber_release @ 2023-11-26 15:35:26