경사로 C++

https://www.acmicpc.net/problem/14890

14890번: 경사로

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
const int MAX = 102;
int n, l;
int map[MAX][MAX];
int answer = 0;

bool CheckWay(vector<int> v) {
	bool flag = false;
	vector<int> visited(n, -1);

	int index;
	for (int j = 0; j < n - 1; j++) {
		index = j;
		while (index <= n - 2 && v[index] == v[index + 1]) {
			index++;
		}
		if (index >= n - 1) {
			flag = true;
			break;
		}
		if (v[index + 1] - v[index] == 1) {
			int count = 0;
			for (int k = index; k >= 0; k--) {
				if (v[index] == v[k] && visited[k] == -1) {
					count++;
				}
				else break;
			}
			if (count >= l) {
				int tmp_i = index;
				for (int k = l; k > 0; k--) {
					visited[tmp_i] = 1;
					tmp_i--;
				}
				j = index;
				if (index == n - 2) {
					flag = true;
					break;
				}
			}
			else break;
		}
		else if (v[index] - v[index + 1] == 1) {
			int count = 0;
			for (int k = index + 1; k < n; k++) {
				if (v[index + 1] == v[k] && visited[k] == -1) {
					count++;
				}
				else break;
			}
			if (count >= l) {
				int tmp_i = index + 1;
				for (int k = l; k > 0; k--) {
					visited[tmp_i] = 1;
					tmp_i++;
				}
				j = index + l - 1;
				if (j == n - 2) {
					flag = true;
					break;
				}
			}
			else break;
		}
		else break;
	}

	return flag;
}

int main(void) {
	cin >> n >> l;

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin >> map[i][j];
		}
	}

	for (int i = 0; i < n; i++) {
		vector<int> v;
		v.resize(n);
		for (int j = 0; j < n; j++) {
			v[j] = map[i][j];
		}
		if (CheckWay(v) == true) {
			answer++;
		}
	}

	for (int j = 0; j < n; j++) {
		vector<int> v;
		v.resize(n);
		for (int i = 0; i < n; i++) {
			v[i] = map[i][j];
		}
		if (CheckWay(v) == true) {
			answer++;
		}
	}

	cout << answer << endl;
}