UVa 10908 - Largest Square

題目：給你一個二維的字符矩陣，求出給定中心的最大正方形邊長。

分析：簡單題、枚舉。枚舉計算即可，為了提高效率可先用dp存儲每行連續字符數。

說明：╮(╯▽╰)╭。

#include <cstdlib>
#include <cstring>
#include <cstdio>

char maps[101][101];
int  sums[101][101];

int main()
{
	int T, N, M, Q, c, r;
	while (~scanf("%d",&T))
	while (T --) { 
		scanf("%d%d%d",&N,&M,&Q);
		for (int i = 0; i < N; ++ i)
			scanf("%s",maps[i]);
		
		memset(sums, 0, sizeof(sums));
		for (int i = 0; i < N; ++ i) {
			sums[i][0] = 1;
			for (int j = 1; j < M; ++ j)
				if (maps[i][j] == maps[i][j-1])
					sums[i][j] = sums[i][j-1]+1;
				else sums[i][j] = 1;
		}
		
		printf("%d %d %d\n",N,M,Q);
		for (int i = 0; i < Q; ++ i) {
			scanf("%d%d",&c,&r);
			int ans = 1;
			for (int j = 1; j < M|| j < N; ++ j) {
				if (c-j < 0 || r-j < 0 || c+j >= N || r+j >= M) 
					break;
				int flag = 1;
				for (int k = c-j; k <= c+j; ++ k)
					if (maps[k][r+j] != maps[c][r] || sums[k][r+j] < 1+j+j) {
						flag = 0;
						break;
					}
				if (flag) ans = j+j+1;
				else break;	
			}
			printf("%d\n",ans);
		}
	}
	return 0;
}