摘要：
```#includeusing namespace std;const int N=305;const int M=9;int maze[N][N];int maxx[N][N][M][M];int n,m;void pre_gao(){ int up1=0,up2=0; while((1<<(up1+1))<n)up1++; while((1<<(up2+1))<m)up2+... 阅读全文
终于等到你