[C++] SWEA D3. [S/W 문제해결 기본] 1일차 - View

출처

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AV134DPqAA8CFAYh&categoryId=AV134DPqAA8CFAYh&categoryType=CODE&problemTitle=&orderBy=INQUERY_COUNT&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=1

SW Expert Academy

 

 

 

풀이

#define _CRT_SECURE_NO_WARNINGS 
#include <bits/stdc++.h>
using namespace std;

int N = 0;
int result = 0;

int solution(int* buildings) {
	int cnt = 0;
	for (int i = 2; i < N-2; i++) {
		int near = max(max(buildings[i - 2], buildings[i - 1]),max(buildings[i + 1], buildings[i + 2]));
		if (near < buildings[i]){
			cnt += buildings[i] - near;
		}
	}
	return cnt;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	for (int i = 1; i < 11; i++) {
		cin >> N;
		int buildings[1001];
		for (int j = 0; j < N; j++) {
			cin >> buildings[j];
		}
		result = solution(buildings);
		cout << "#" << i << " " << result << endl;
	}
}