#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 305;
const int inf = 0x7ffffff;
int n,m,k,map[maxn][maxn],sum[maxn][maxn];
char str[maxn];
int main()
{
while(scanf("%d%d%d",&n,&m,&k),n+m+k)
{
for(int i = 1; i <= n; i++)
{
scanf("%s",str+1);
for(int j = 1; j <= m; j++)
{
if(str[j] == '.')
map[i][j] = 1;
else map[i][j] = 0;
sum[i][j] = sum[i][j-1] + map[i][j];
}
}
for(int i = 2; i <= n; i++)
for(int j = 1; j <= m; j++)
sum[i][j] += sum[i-1][j];
int ans = inf;
for(int i = 1; i <= m; i++)
for(
『杭电1937』Finding Seats
最新推荐文章于 2025-08-05 19:50:13 发布