AcWing 3785. 战舰
原题链接
简单
作者:
lyf11
,
2021-07-30 23:04:43
,
所有人可见
,
阅读 259
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 110;
int n, k;
char g[N][N];
int main()
{
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i ++ ) scanf("%s", g[i] + 1);
int x = 1, y = 1, res = 0;
for (int i = 1; i <= n; i ++ )
for (int j = 1; j <= n; j ++ )
{
if (g[i][j] == '#') continue;
int l = j, r = j;
while (l >= 1 && g[i][l] == '.' && j - l + 1 <= k) l -- ;
while (r <= n && g[i][r] == '.' && r - j + 1 <= k) r ++ ;
int t = max(0, r - l - k);
l = r = i;
while (l >= 1 && g[l][j] == '.' && i - l + 1 <= k) l -- ;
while (r <= n && g[r][j] == '.' && r - i + 1 <= k) r ++ ;
t += max(0, r - l - k);
if (t > res)
{
res = t;
x = i, y = j;
}
}
printf("%d %d\n", x, y);
return 0;
}