问ACM乔利跳投2

EN

#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
    vector <int> num;
    vector <int> num1;
    int n,temp,j=0;
    cin>>n;
    for(int i= 0 ; i<n ; i++)
    {
        cin>>temp;
        num.push_back(temp);
    }
    for(int i=0; i<num.size() ; i++)
    {
        if(i+1 < num.size())
        {
            num1.push_back(abs(num[i]-num[i+1]));
        }
    }
    for(int i=0 ; i<num1.size() ; i++)
    {
        if(i+1 < num1.size())
        {
            if(num1[i] == num1[i+1])
            {
                cout<<"Not jolly"<<endl;
                return 0;
            }
        }
    }
    sort(num1.begin(),num1.end());
    for(int i=0 ; i<num1.size() ; i++)
    {
        if(i+1 < num1.size())
        {
            if(num1[i]+1 != num1[i+1])
            {
                cout<<"Not jolly"<<endl;
                return 0;
            }
        }
    }
    cout<<"Jolly"<<endl;
}