ソースコード
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstring>
#define int long long
using namespace std;
#define rep(i, n) for(int i=0;i<(n);++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_bound
int N, H, W;
char F[11][11];
vector<int> Ws, Hs;
signed main() {
cin >> N >> H >> W;
rep(i, H) {
rep(j, W) {
cin >> F[i][j];
}
}
rep(i, H) {
int num = 0;
rep(j, W) {
if (F[i][j] == '.')num++;
else {
if (num == 0)continue;
Ws.push_back(num);
num = 0;
}
}
if (num == 0)continue;
Ws.push_back(num);
}
rep(i, W) {
int num = 0;
rep(j, H) {
if (F[j][i] == '.')num++;
else {
if (num == 0)continue;
Hs.push_back(num);
num = 0;
}
}
if (num == 0)continue;
Hs.push_back(num);
}
sort(Hs.begin(), Hs.end());
sort(Ws.begin(), Ws.end());
for (int i = 1; i <= N; ++i) {
int ans1 = 0;
for (int r = 1; r <= 10; ++r) {
ans1 += l_b(Hs.begin(), Hs.end(), INF) - l_b(Hs.begin(), Hs.end(), r * i);
}
int ans2 = 0;
for (int r = 1; r <= 10; ++r) {
ans2 += l_b(Ws.begin(), Ws.end(), INF) - l_b(Ws.begin(), Ws.end(), r * i);
}
cout << max(ans1, ans2) << endl;
}
}