iframe-proxy | Sunbelt Computer Software

History

59 lines (58 loc) · 1.17 KB

Raw

#include <iostream>

#include <vector>

#include <algorithm>

using namespace std;

int check(vector<string> &a){

int n = a.size();

int ans = 1; // 답: answer

for(int i=0; i<n; i++){

int cnt= 1;

for(int j=1; j<n; j++){

// i 행 같은게 있는지 쭉 확인

if(a[i][j] == a[i][j-1]){

cnt += 1;

} else {

cnt = 1;

}

if(ans<cnt) ans=cnt; // 최대값 저장

}

cnt = 1;

for(int j=1;j<n;j++){

// i열 같은게 있는지 확인

if(a[j][i] == a[j-1][i]){

cnt+=1;

} else {

cnt = 1;

}

if (ans<cnt) ans = cnt;

}

return ans;

}

int main(){

int n;

cin>>n;

vector<string> a(n);

for(int i=0; i<n; i++){

cin >> a[i];

}

int ans= 0;

for(int i=0;i<n; i++){

for (int j=0; j<n; j++){

if(j+1 <n){

swap(a[i][j], a[i][j+1]);

int temp = check(a);

if(ans <temp) ans = temp;

swap(a[i][j], a[i][j+1]);// 원래대로 돌려놓기

}

if(i+1 <n){

swap(a[i][j], a[i+1][j]);

int temp = check(a);

if(ans<temp) ans= temp;

swap(a[i][j], a[i+1][j]);

}

cout << ans << '\n';

return 0;

}

Sunbelt Computer Software

PL/B Language Development and Support

Navigation Menu

Sunbelt Computer Software

PL/B Language Development and Support

FilesExpand file tree

bruteforce3085.cpp

Latest commit

History

bruteforce3085.cpp

File metadata and controls