47. 봉우리

 

 

▣ 입력예제 

 

5

5 3 7 2 3

3 7 1 6 1

7 2 5 3 4

4 3 6 4 1

8 7 3 5 2

 

 

▣ 출력예제

 

10

 

 

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

using namespace std;

int map[51][51];

int main() 
{

	int dx[4] = {-1,0,1,0};
	int dy[4] = {0,1,0,-1};

	int n,k,flag,cnt = 0;

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

	for (int i = 1; i <= n; ++i)
	{
		for (int j = 1; j <= n; ++j)
		{
			flag = 0;
			for (k = 0; k < 4; ++k)
			{
				if (map[i + dx[k]][j + dy[k]] >= map[i][j])
				{
					flag = 1;
					break;
				}
			}

			if (flag == 0)
			{
				cnt++;
			}
		}
	}

	cout << cnt;
}