codeforces611C

题意：给一个下图这样的矩阵，'.'表示空位置，‘#’表示墙，给一个木块，长度为2个单位，可横放可竖放，问有几种放法？

....#..#
.#......
##.#....
##..#.##
........

解析：这是一个前缀和的问题，我们可将二维矩阵拆成两个一维前缀和：行缀和与列缀和，行缀和即为木块在某一行放置的种数，列缀和同理；然后再分别一行行一列列的加起来，得出结果。

代码如下：

#include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<stdio.h>
using namespace std;
typedef long long ll;
const int maxn = 551;
int h, w;
int sum1[maxn][maxn];
int sum2[maxn][maxn];
char c[maxn][maxn];
int q;
int r1, c1, r2, c2;
int main()
{
	scanf("%d %d", &h, &w);
	getchar();//这里的getchar()不要忘了，一开始没清除缓存区，矩阵没读进来。。。
	for (int i = 1; i <= h; i++) {
		for (int j = 1; j <= w; j++) {
			scanf("%c", &c[i][j]);
		}
		getchar();
	}
	
	memset(sum1, 0, sizeof(sum1));
	memset(sum2, 0, sizeof(sum2));
	for (int i = 1; i <= h; i++) {
		for (int j = 1; j<w; j++) {
			if (c[i][j] == '.'&&c[i][j + 1] == '.') {//计算行的前缀和 
				sum1[i][j+1] = sum1[i][j] + 1;
			}
			else {
				sum1[i][j+1] = sum1[i][j];
			}
		}
	}
	/*for (int i = 1; i <= h; i++) {
		for (int j = 1; j <= w; j++) {
			printf("%d", sum1[i][j]);
		}
		printf("\n");
	}*/
	for (int i = 1; i <= w; i++) {
		for (int j = 1; j<h; j++) {
			if (c[j][i] == '.'&&c[j + 1][i] == '.') {//计算列的前缀和 
				sum2[j+1][i] = sum2[j][i] + 1;
			}
			else {
				sum2[j+1][i] = sum2[j][i];
			}
		}
	}
	/*printf("\n\n");
	for (int i = 1; i <= h; i++) {
		for (int j = 1; j <= w; j++) {
			printf("%d", sum2[i][j]);
		}
		printf("\n");
	}*/
	scanf("%d", &q);
	int ans = 0;
	while (q--) {
		ans = 0;
		scanf("%d%d%d%d", &r1, &c1, &r2, &c2);
		for (int i = r1; i <= r2; i++) {
			ans += (sum1[i][c2] - sum1[i][c1]);//一行行的和 
		}
		for (int i = c1; i <= c2; i++) {
			ans += (sum2[r2][i] - sum2[r1][i]);//一列列的和 
		}
		printf("%d\n", ans);
	}
	return 0;
}