Untitled

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int largestPlusSign(vector<vector<char>>& matrix) {
    int m = matrix.size();
    int n = matrix[0].size();
    
    if (m == 0 || n == 0) return 0;

    // Create matrices to store counts of consecutive '1's in all four directions
    vector<vector<int>> left(m, vector<int>(n, 0));
    vector<vector<int>> right(m, vector<int>(n, 0));
    vector<vector<int>> up(m, vector<int>(n, 0));
    vector<vector<int>> down(m, vector<int>(n, 0));
    
    // Fill the left and right matrices
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < n; ++j) {
            if (matrix[i][j] == '1') {
                left[i][j] = (j == 0) ? 1 : left[i][j - 1] + 1;
            }
        }
        for (int j = n - 1; j >= 0; --j) {
            if (matrix[i][j] == '1') {
                right[i][j] = (j == n - 1) ? 1 : right[i][j + 1] + 1;
            }
        }
    }
    
    // Fill the up and down matrices
    for (int j = 0; j < n; ++j) {
        for (int i = 0; i < m; ++i) {
            if (matrix[i][j] == '1') {
                up[i][j] = (i == 0) ? 1 : up[i - 1][j] + 1;
            }
        }
        for (int i = m - 1; i >= 0; --i) {
            if (matrix[i][j] == '1') {
                down[i][j] = (i == m - 1) ? 1 : down[i + 1][j] + 1;
            }
        }
    }
    
    // Determine the largest plus sign
    int maxSize = 0;
    for (int i = 1; i < m - 1; ++i) {
        for (int j = 1; j < n - 1; ++j) {
            if (matrix[i][j] == '1') {
                int size = min({left[i][j], right[i][j], up[i][j], down[i][j]});
                maxSize = max(maxSize, size);
            }
        }
    }
    
    return maxSize - 1;
}