7-31每日一题：二叉树的垂序遍历

Leetcode二叉树的垂序遍历

Acwing每日一题：战舰

#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] == '.' && l >= j - k + 1) l -- ;
            while (r <= n && g[i][r] == '.' && r <= j + k - 1) r ++ ;
            int t = max(0, r - l - k);
            l = i, r = i;
            while (l >= 1 && g[l][j] == '.' && l >= i - k + 1) l -- ;
            while (r <= n && g[r][j] == '.' && r <= i + k - 1) r ++ ;
            t += max(0, r - l - k);
            if (t > res)
            {
                res = t;
                x = i, y = j;
            }
        }
    
    printf("%d %d\n", x, y);
}