Brush questions - Luogu -p1152 happy jump

P1152 Happy jump -C Language

1、 subject

2、 The problem solving process

result ：

Code ：

// Luogu  P1152  Happy jump 
#include <stdio.h>
#define NUM 1000//1≤n≤1000
int main() {
    
	int n;//n Elements 
	int a[NUM];//n An integer array of elements 
	int d_value[NUM] = {
     0 };
	int j = 0;
	int i;
	int temp;
	scanf("%d", &n);
	for (i = 0; i < n; i++) {
    
		if (i == 0) {
    
			scanf("%d", &a[i]);
		}
		else {
    
			scanf("%d", &a[i]);
			temp= a[i] - a[i - 1];
			d_value[j] = temp > 0 ? temp : (-1 * temp);// The absolute value 
			j++;
		}
	}
	/* printf(" The data of the difference array is ：\n"); for (i = 0; i < n-1; i++) {// after n-1 Number of differences  printf(" %d ", d_value[i]); }*/
	int k = n - 1;
	// Use bubble sorting to determine whether there are duplicate values , And judge the endpoints at both ends 
	for (i = 0; i < k-1 ; i++) {
    // Conduct k-1 Secondary effervescence 
		for (j = 1; j <k; j++) {
    
			if (d_value[j] == d_value[j - 1]) {
    
				printf("Not jolly");// Jump not in line with joy 
				return 0;
			}
			else if (d_value[j - 1] > d_value[j]) {
    
				temp = d_value[j-1];
				d_value[j-1] = d_value[j];
				d_value[j] = temp;
			}

		}
	}
	/* printf("\n The data of the sorted difference array is ：\n"); for (i = 0; i < n-1; i++) { printf(" %d ", d_value[i]); } printf("\n");*/
	if (d_value[0] != 1) {
    
		printf("Not jolly");// Jump not in line with joy 
	}
	else if(d_value[n - 2] != (n - 1)){
    
		printf("Not jolly");// Jump not in line with joy 
	}
	else {
    
		printf("Jolly");// Jump in line with joy 
	}
	/* if ((d_value[0] == 1) & (d_value[n - 2] == n - 1)) { printf("Jolly");// Jump in line with joy  } else { printf("Not jolly");// Jump not in line with joy  }*/
	return 0;
}