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

#include<iostream>
#include<vector>
#include<algorithm>
 
using namespace std;
 
vector<int>arr;
 
int cnt = 0;
void check(int i) {
    int jo[4];
    jo[0] = arr[i] - arr[i - 2];
    jo[1] = arr[i] - arr[i - 1];
    jo[2] = arr[i] - arr[i + 1];
    jo[3] = arr[i] - arr[i + 2];
 
    sort(jo, jo + 4);
 
    cnt += jo[0];
}
 
void run() {
    arr.clear();
    cnt = 0;
 
    int n;
    cin >> n;
     
    int ch;
    for (int i = 0; i < n; i++) {
        cin >> ch;
        arr.push_back(ch);
    }
 
    for (int i = 2; i < n - 2; i++) {
        if (arr[i] > arr[i - 1] && arr[i] > arr[i - 2]
            && arr[i] > arr[i + 1] && arr[i] > arr[i + 2])
            check(i);
    }
 
 
}
 
int main() {
    int sun = 0;
 
    for (int i = 0; i < 10; i++)
    {
        sun++;
        run();
        cout << "#" << sun << " " <<cnt<< endl;
    }
     
    return 0;
}