code-problems/Algorithm/Brute-Force/boj3085.cpp at master · wildDoubt/code-problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <string>
#include <functional>

using namespace std;

const int MAX = 10e+6;
const int INF = 0x66554433;

vector<string> maps;
int n;

inline void Quick_IO(){
    ios_base :: sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}

int check(){
    int result = 0;
    for (int i = 0; i < n; ++i) {
        int temp = 1;
        for (int j = 1; j < n; ++j) {
            if(maps[i][j] == maps[i][j-1]) temp++;
            else{
                result = max(result, temp);
                temp = 1;
            }
        }
        result = max(result, temp);
    }
    for (int i = 0; i < n; ++i) {
        int temp = 1;
        for (int j = 1; j < n; ++j) {
            if(maps[j][i] == maps[j-1][i]) temp++;
            else{
                result = max(result, temp);
                temp = 1;
            }
        }
        result = max(result, temp);
    }
    return result;
}

int main(){
    Quick_IO();

    int maxValue = 0;
    string a;
    cin>>n;


    for (int i = 0; i < n; ++i) {
        cin>>a;
        maps.push_back(a);
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n-1; ++j) {
            swap(maps[i][j], maps[i][j+1]);
            maxValue = max(maxValue, check());
            swap(maps[i][j], maps[i][j+1]);
            swap(maps[j][i], maps[j+1][i]);
            maxValue = max(maxValue, check());
            swap(maps[j][i], maps[j+1][i]);
        }
    }
    cout<<maxValue<<endl;
    return 0;
}