글
[알고리즘 자료] 1. [C/C++] 4방향 체인코드를 이용한 논 크기 측정 문제
Test.txt 6 8 1 1 1 0 1 1 0 0 0 0 1 0 0 1 1 1 0 1 1 1 0 1 1 0 1 1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 1 1 1 1 1 0 0 1 0 0 1 1 0 0 1 1 1 0 7 1 1 1 0 1 1 0 0 0 1 0 0 1 1 0 1 1 1 0 1 1 1 1 1 0 0 1 1 0 0 0 0 0 0 0 0 1 1 1 1 0 1 1 1 1 0 0 1 0 5 1 1 1 0 1 0 0 1 0 0 0 1 1 1 0 1 1 1 0 0 0 0 0 0 0 7 1 1 1 0 1 1 0 0 0 1 0 0 1 1 0 1 1 1 0 1 1 1 1 1 0 0 1 1 0 0 0 0 0 0 0 0 1 1 1 1 0 1 1 1 1 0 0 1 0 10 1 1 1 0 1 1 1 1 0 1 0 0 1 0 0 0 1 1 1 0 1 1 1 0 0 0 0 0 0 0 0 0 1 0 0 1 1 1 0 1 0 0 1 0 0 0 1 1 1 0 1 1 1 0 0 0 0 0 0 0 0 1 1 1 0 1 1 1 0 0 0 0 0 0 0 1 1 1 0 1 0 0 1 0 0 0 1 1 1 0 1 1 1 0 0 0 0 0 0 0 9 1 1 1 0 1 1 1 1 0 0 0 1 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 0 0 1 0 0 1 1 1 0 0 0 1 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 0 1 1 1 0 1 1 1 0 0 0 0 0 0 1 1 1 0 이며 답으로는 아래 그림처럼 얻을 수 있습니다 #TestCase : GroupNum, GroupSize .. 추가로 읽으면 좋을 것