ZOJ 2067 HDU 1510 White Rectangles

White Rectangles

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

You are given a chessboard made up of N squares by N squares with equal size. Some of the squares are colored black, and the others are colored white. Please write a program to calculate the number of rectangles which are completely made up of white squares.

Input

There are multiple test cases. Each test case begins with an integer N (1 <= N <= 100), the board size. The following N lines, each with N characters, have only two valid character values:

# - (sharp) representing a black square;
. - (point) representing a white square.

Process to the end of file.

Output

For each test case in the input, your program must output the number of white rectangles, as shown in the sample output.

Sample Input

2
.#
..
4
..#.
##.#
.#..
.#.#

Sample Output

5
15

#include <stdio.h>
#include <string.h>
#define MAX 110
#define inf 0x7fffffff
char a[MAX][MAX];
int count[MAX][MAX];
int n;

int min(int x,int y)
{
	return x<y?x:y;
}

void sum()
{
	int i,j;
	for(i = 1;i <= n; i++)
	{
		for(j = 1;j <= n; j++)
		{
			if(a[i][j] == '.')
			{
				count[i][j] = count[i][j - 1] + 1; 
			}
		}
	}
}

int Min()
{
	int i,j,k;
	int ans = 0;
	for(i = 1;i <= n; i++)
	{
		for(j = 1;j <= n; j++)
		{
			int m = inf;
			for(k = i;k <= n && count[k][j]; k++)//1列1列判断 中间断了结束 
			{
				m = min(m,count[k][j]);
				ans += m;
			}
		}
	}
	return ans;
}
int main()
{
	int i;
	while(scanf("%d",&n)!=EOF)
	{
		for(i = 1;i <= n; i++)
			scanf("%s",a[i] + 1);
		memset(count,0,sizeof(count));
		sum();
		printf("%d\n",Min());
	}
	return 0;
}