Codeforces Round #356 (Div. 1) C

题意：

你有一张图，"."表示空地"X"表示墙，你的好朋友大灰熊可以帮你打烂一个k*k方格里所有的墙，问这样操作后这张图能存在的最大连通块的大小是多少

题解：

先做一遍搜索，把每个空地属于的连通块找出并统计其大小。考虑每一个可以选择k*k的位置，枚举其左上角，从上到下、从左往右。每次把当前k*k方格内所属的连通块清除，转移是O(k)的，剩下部分就不解释了

复杂度 O(n*n*k + n*k*k)

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;

const int maxn = 510;
const int dx[4] = {0,1,0,-1};
const int dy[4] = {-1,0,1,0};

int n,k,cur,ti,now,ans,siz[maxn*maxn],po[maxn][maxn],vis[maxn*maxn];
char p[maxn][maxn];

bool inside(int x,int y)
{
	return 0 <= min(x,y) && max(x,y) < n;
}

void dfs(int x,int y,int num)
{
	++siz[num]; po[x][y] = num;
	for (int i = 0; i < 4; i++) {
		int xx = x + dx[i];
		int yy = y + dy[i];
		if (inside(xx,yy) && p[xx][yy] == '.' && !po[xx][yy]) dfs(xx,yy,num);
	}
}

void add(int x,int y)
{
	if (!inside(x,y)) return;
	if (vis[po[x][y]] != ti && p[x][y] == '.')
		vis[po[x][y]] = ti,now += siz[po[x][y]];
}

int main()
{
	#ifdef YZY
		   freopen("yzy.txt","r",stdin);
	#endif
	
	cin >> n >> k;
	for (int i = 0; i < n; i++) scanf("%s",p[i]);
	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			if (p[i][j] == '.' && !po[i][j])
				dfs(i,j,++cur);
	for (int x = 0; x + k <= n; x++) {
		for (int i = x; i <= x + k - 1; i++)
			for (int j = 0; j < k; j++)
				if (p[i][j] == '.')
					--siz[po[i][j]];
		for (int y = 0; y + k <= n; y++) {
			++ti; now = k*k;
			for (int i = x; i <= x + k - 1; i++) add(i,y-1),add(i,y+k);
			for (int j = y; j <= y + k - 1; j++) add(x-1,j),add(x+k,j);
			ans = max(ans,now);
			for (int i = x; i <= x + k - 1; i++) {
				if (p[i][y] == '.') ++siz[po[i][y]];
				if (p[i][y+k] == '.') --siz[po[i][y+k]];
			}
		}
		for (int i = x; i <= x + k - 1; i++)
			for (int j = n-k+1; j < n; j++)
				if (p[i][j] == '.')
					++siz[po[i][j]];
	}
	cout << ans;
	return 0;
}