不开__见祖宗
by ADay @ 2020-05-02 22:10:30
@[command_z](/user/342246) 这种题一看就是dp的题啊，为何加了那么多if
by BlueSu @ 2020-05-02 22:13:42
@[command_z](/user/342246) dp:
```cpp
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
unsigned long long tmp[30][30];
unsigned long long map[30][30];
int main(){
int n,m,a,b;
cin>>n>>m>>a>>b;
n+=2,m+=2,a+=2,b+=2;
tmp[a][b]=tmp[a-2][b-1]=tmp[a-2][b+1]=tmp[a-1][b-2]
=tmp[a-1][b+2]=tmp[a+1][b-2]=tmp[a+1][b+2]
=tmp[a+2][b-1]=tmp[a+2][b+1]=1;
map[2][2]=1;
for(int i=2;i<=n;i++){
for(int j=2;j<=m;j++){
if(tmp[i][j]!=1)
map[i][j]=max(map[i][j],map[i-1][j]+map[i][j-1]);
}
}
cout<<map[n][m]<<endl;
return 0;
}
```
by BlueSu @ 2020-05-02 22:15:11
@[command_z](/user/342246) 还有一种办法：download数据
by BlueSu @ 2020-05-02 22:16:34