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

문제

swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV134DPqAA8CFAYh&categoryId=AV134DPqAA8CFAYh&categoryType=CODE

SW Expert Academy

---

 

코드

#include<iostream>
#include<algorithm>

using namespace std;
int a[1000];
int main() {

	ios::sync_with_stdio(false);
	cin.tie(NULL);

	for (int test = 1; test <= 10; test++) {
		int n;
		cin >> n;
		for (int i = 0; i < n; i++) {
			cin >> a[i];
		}
		int ans = 0;
		int temp = 0;
		for (int i = 2; i < n - 2; i++) {
			if ((temp = a[i] - max(max(a[i - 1], a[i - 2]), max(a[i + 1], a[i + 2]))) > 0)
			{
				ans += temp;
			}
		}
		cout <<"#"<<test<<" "<< ans << '\n';
	}
	return 0;
}