24. Jolly Jumpers [코드구현력 기르기]

나의정답.

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cstdlib>

using namespace std;

int main(int argc, char** argv) {
	//freopen("input.txt", "rt", stdin);

	int n, i, max = -1;
	bool a = false;
	
	scanf("%d", &n);
	
	vector<int> arr(n);
	vector<int> sub(n-1);
	
	for(i = 0; i < n; i++){
		scanf("%d", &arr[i]);
	}
	
	for(i = 0 ; i < n - 1; i++){
		sub[i] = abs(arr[i] - arr[i+1]);
		
		if(sub[i] > max)
			max = sub[i];
	}
	
	for(i = 1 ; i < max; i++){
		a = false;
		
		for(int j = 0 ; j < n-1 ; j++){
			if(sub[j] == i){
				a = true;
				break;
			}
		}
		
		if(a == false){
			printf("NO");
			break;
		}
	}
	if(a) printf("YES");
}