[백준/BOJ] 백준 코딩 알고리즘 3085번/C++

백준 코딩 알고리즘 문제 3085번

백준 코딩 알고리즘 문제 3085번 풀이 - 사용 언어: C++

#include <iostream>
#include <string>
#include <algorithm>
 
using namespace std;
 
string BOARD[50];
int N;
 
int check() {
 
    int temp = 1;
    int horizontalMax = 1;
    int verticalMax = 1;
 
    //가로 체크
    for (int i = 0; i < N; i++) {
        temp = 1;
        for (int j = 0; j < N - 1; j++) {
            if (BOARD[i][j] == BOARD[i][j + 1]) {
                temp++;
            }
            else {
                horizontalMax = max(horizontalMax, temp);
                temp = 1;
            }
        }
        horizontalMax = max(horizontalMax, temp);
    }
 
    //세로 체크
    for (int i = 0; i < N; i++) {
        temp = 1;
        for (int j = 0; j < N - 1; j++) {
            if (BOARD[j][i] == BOARD[j + 1][i]) {
                temp++;
            }
            else {
                verticalMax = max(verticalMax, temp);
                temp = 1;
            }
        }
        verticalMax = max(verticalMax, temp);
    }
 
    //둘중 최대값 리턴
    return max(horizontalMax, verticalMax);
}
 
int horizontalSwap() {
 
    int temp;
    int horizontalMax = 0;
 
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N - 1; j++) {
            //가로스왑
            temp = BOARD[i][j];
            BOARD[i][j] = BOARD[i][j + 1];
            BOARD[i][j + 1] = temp;
            //체크
            horizontalMax = max(horizontalMax, check());
            //원상복귀
            temp = BOARD[i][j];
            BOARD[i][j] = BOARD[i][j + 1];
            BOARD[i][j + 1] = temp;
        }
    }
 
    return horizontalMax;
 
}
 
int verticalSwap() {
 
    int temp;
    int verticalMax = 0;
 
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N - 1; j++) {
            //세로스왑
            temp = BOARD[j][i];
            BOARD[j][i] = BOARD[j + 1][i];
            BOARD[j + 1][i] = temp;
            //체크
            verticalMax = max(verticalMax, check());
            //원상복귀
            temp = BOARD[j][i];
            BOARD[j][i] = BOARD[j + 1][i];
            BOARD[j + 1][i] = temp;
        }
    }
 
    return verticalMax;
 
}
 
int main() {
 
    cin >> N;
 
    //보드 채워넣기
    for (int i = 0; i < N; i++) {
        cin >> BOARD[i];
    }
 
    cout << max(horizontalSwap(), verticalSwap());
 
    return 0;
 
}