Gym100608 J. Jinxiety of a Polyomino

（因为是凸多边形）在点（U[i][j], L[i][j]）——（i,j）子矩形中所有点到i,j这个点都只需要转一个弯。矩阵前缀和预处理。

#include <bits/stdc++.h>
using namespace std;
const int MX = 2007;
int n,m,res;
char s[MX][MX];
int L[MX][MX],U[MX][MX],sum[MX][MX],ans[MX][MX];
void solve()
{
	for(int i = 1;i <= n; i++)
        for(int j = 1;j <= m; j++){
			sum[i][j]=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1]+(s[i][j]=='#');
			U[i][j] = i;
			L[i][j] = j;
			ans[i][j] = 0;
        }

	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			if(s[i-1][j]=='#') U[i][j]=U[i-1][j];
			if(s[i][j-1]=='#') L[i][j]=L[i][j-1];
		}
	}
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			if(s[i][j]=='#' && sum[i-1][j-1] > 0)
				ans[i][j]=ans[U[i][j]][L[i][j]]+1;
			res=max(res,ans[i][j]);
		}
	}
}
int main()
{
#ifdef LOCAL
    freopen("input.txt","r",stdin);
#else
    freopen("jinxiety.in", "r", stdin);
    freopen("jinxiety.out","w", stdout);
#endif // LOCAL
	while(~scanf("%d%d",&n,&m) && n && m)
	{
		for(int i=1;i<=n;i++)
			scanf("%s",s[i]+1);
		res=0;
		solve();
		for(int i=1;i<=n;i++)
			reverse(s[i]+1,s[i]+1+m);
		solve();
		printf("%d\n",res);
	}
	return 0;
}