图上递推线性可曲DP,
k->n+m的原因是因为最坏情况为对角线为递推线路。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
char s[200];
int f[200][200],mp[200][200],n,m;
int main(){
freopen("bit.in","r",stdin);
freopen("bit.out","w",stdout);
scanf("%d%d",&n,&m);
memset(f,0x3f,sizeof(f));
for(register int i=1;i<=n;i++){
scanf("%s",s);
for(register int j=1;j<=m;j++){
mp[i][j]=s[j-1]-'0';
if(mp[i][j]==1)f[i][j]=0;
}
}
for(register int k=1;k<=m+n;k++)
for(register int i=1;i<=n;i++)
for(register int j=1;j<=m;j++){
f[i][j]=min(f[i][j],f[i][j+1]+1);
f[i][j]=min(f[i][j],f[i+1][j]+1);
f[i][j]=min(f[i][j],f[i-1][j]+1);
f[i][j]=min(f[i][j],f[i][j-1]+1);
}
for(register int i=1;i<=n;i++){
for(register int j=1;j<=m;j++)
printf("%d ",f[i][j]);
printf("\n");
}
return 0;
}