CodeForces 611C New Year and Domino(DP)

给定一个矩形。要求算出该矩形里相邻两个元素都为空的个数；

查询次数很多  所以先对大的矩形dp分别求列上的个数和行上的个数，然后根据给出的条件逐个求和

#include<iostream>
#include<cstdio>
#include<set>
#include<string>
#include<string.h>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<algorithm>
#include<sstream>
#include<utility>
#include<cmath>
#include<functional>
#define mt(a) memset(a,0,sizeof (a))
#define fl(a,b,c) fill(a,b,c)
#define SWAP(a,b,t) (t=a,a=b,b=t)

#define inf 1000000000+7
#define sp system("pause")

using namespace std;
typedef long long ll;

char G[550][550];
int dp1[550][550];
int dp2[550][550];

void init()
{
	mt(G);
	mt(dp1);
	mt(dp2);
}

int main()
{
	init();
	int r, c;
	cin >> r >> c;
	for (int i = 0; i < r; i++)
	{
		scanf("%s", G[i]);
	}
	for (int i = 0; i < r; i++)
	{
		for (int j = 0; j < c; j++)
		{
			if (j == 0)continue;
			if (G[i][j] == '.'&&G[i][j - 1] == '.')dp1[i][j] = dp1[i][j - 1] +1 ;
			else dp1[i][j] = dp1[i][j - 1];
		}
	}
	for (int i = 0; i < c; i++)
	{
		for (int j = 0; j < r; j++)
		{
			if (!j)continue;
			dp2[j][i] = (G[j][i] == '.'&&G[j - 1][i] == '.') ? dp2[j - 1][i] + 1 : dp2[j - 1][i];
		}
	}
	int q;
	cin >> q;
	while (q--)
	{
		int q1, q2, q3, q4;
		scanf("%d%d%d%d", &q1, &q2, &q3, &q4);
		int ans = 0;
		for (int i =q2-1; i <= q4-1; i++)
		{
			ans += (dp2[q3-1][i] - dp2[q1-1][i]);
		}
		for (int i = q1-1; i <= q3-1; i++)
		{
			ans += (dp1[i][q4-1] - dp1[i][q2-1]);
		}
		printf("%d\n", ans);
	}
	//sp;
	return 0;
}