牛客Butterfly

最新推荐文章于 2023-10-10 11:22:24 发布

b_b_lai_lai

最新推荐文章于 2023-10-10 11:22:24 发布

阅读量110

点赞数

分类专栏：杂题

原文链接：https://blog.youkuaiyun.com/m0_46070659/article/details/106326898

版权

杂题专栏收录该内容

38 篇文章

订阅专栏

Butterfly

题目链接
在这里插入图片描述

#include <stdio.h>
#include <algorithm>

using namespace std;
const int maxn = 2005;
char map[maxn][maxn];
int len1[maxn][maxn], len2[maxn][maxn];
int len3[maxn][maxn];

int main() {
    int n, m;
    int i, j;
    char ch;
    scanf("%d%d", &n, &m);
    ch = getchar();
    while (ch != '\n')
        ch = getchar();
    for (i = 1; i <= n; ++i) {
        for (j = 1; j <= m; ++j) {
            scanf("%c", &map[i][j]);
            if (map[i][j] == 'X') {
                len1[i][j] = len1[i - 1][j - 1] + 1;
                len2[i][j] = len2[i - 1][j + 1] + 1;
                len3[i][j] = len3[i - 1][j] + 1;
            }
        }
        ch = getchar();
        while (ch != '\n')
            ch = getchar();
    }

    int d, k;
    int ans = 0;
    for (i = 1; i <= n; ++i) {
        for (j = 1; j <= m; ++j) {
            d = min(len3[i][j], len1[i][j]);
            if (d % 2 == 0)
                d--;
            for (k = d; k > 0 && k > ans; k -= 2) {
                int tmp;
                tmp = j - k + 1;
                if (len3[i][tmp] >= k && len2[i][tmp] >= k) {
                    ans = k;
                    break;
                }
            }
        }
    }
    printf("%d\n", ans);
    return 0;
}