洛谷P3654 First Step (ファーストステップ)进阶解法

#include<cstdio>

using namespace std;
char court[105][105];
int R, C, K, s;

int main()
{
	scanf("%d%d%d", &R, &C, &K);
	getchar();
	for (int i = 0; i < R; i++)
	{
		for (int j = 0; j < C; j++)
			court[i][j] = getchar();
		getchar();
	}
	if (1 == K)
	{
		for (int i = 0; i < R; i++)
			for (int j = 0; j < C; j++)
				if (court[i][j] == '.')
					s++;
	}
	else
	{
		for (int i = 0; i < R; i++)
			for (int j = 0; j < C; j++)
			{
				for (int k = 0; k < K; k++)
					if (court[i][j + k] != '.' || j + k >= C)
						goto A;
				s++;
			A:;
			}
		for (int j = 0; j < C; j++)
			for (int i = 0; i < R; i++)
			{
				for (int k = 0; k < K; k++)
					if (court[j + k][i] != '.' || j + k >= C)
						goto B;
				s++;
			B:;
			}
	}
	printf("%d", s);
	return 0;
}