uva 10038 - Jolly Jumpers

 #include <iostream>
 #include <cstdio>
 #include <stdlib.h>
 using namespace std;
 
 int seq[], diff[];
 
 int main()
 {
     int n, i, j, flag, min_index;
     while(scanf("%d", &n) != EOF)
     {
         for (i = ; i <= n; i++)    // initial
             scanf("%d", &seq[i]);
 
         for (i = ; i <= n-; i++)    // the difference
             diff[i] = abs(seq[i+] - seq[i]);
 
         for(i = ; i < n-; i++)    // select_sort
         {
             min_index = i;
             for (j = i+; j <= n-; j++)
             {
                 if (diff[j] < diff[min_index])
                 {
                     min_index = j;
                 }
             }
             swap(diff[i], diff[min_index]);
         }
 
         flag = ;
         for (i = ; i <= n-; i++)
         {
             if (diff[i] != i)
             {
                 cout << "Not jolly" << endl;
                 flag = ;
                 break;
             }
         }
         if(flag)
             cout << "Jolly" << endl;
     }
 
     return ;
 }