[1차원 배열 연습 문제] View - 1206

문제 : https://swexpertacademy.com/main/learn/course/lectureProblemViewer.do

SW Expert Academy

 

코드 : 

#include <iostream>

using namespace std;

int num[1000] = { 0 };

int solution(int size)
{
	int total = 0;
	for (int i = 2; i < size - 2; i++)
	{
		int max = 0;
		for (int c = -2; c < 3; c++)
		{
			if (c == 0) 
				continue;
			if (max < num[i + c])
			{
				max = num[i + c];
			}
		}
		int diff = num[i] - max;
		if (diff > 0)
		{
			total += diff;
		}
	}
	return total;
}

int main()
{
	int N = 10;

	int length = 0;
	int i = 0;
	while (i < N)
	{
		cin >> length;
		for (int c = 0; c < length; c++)
		{
			cin >> num[c];
		}
		int v = solution(length);
		i++;
		cout << "#" << i << " " << v << "\n";
	}
	return 0;
}