1857-Jolly Jumpers ZCMU

最新推荐文章于 2022-04-04 22:21:10 发布

原创最新推荐文章于 2022-04-04 22:21:10 发布 · 310 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#简单题

练习专栏收录该内容

160 篇文章

订阅专栏

本文介绍了一种算法，用于判断一个整数序列是否为Jolly Jumper序列。该序列的特点是相邻元素间的绝对差值需涵盖从1到n-1的所有整数值，且每个差值只出现一次。

Description

A sequence of n > 0 integers is called a jolly jumper if the absolute values of the difference between successive elements take on all the values 1 through n-1. For instance,

1 4 2 3

is a jolly jumper, because the absolutes differences are 3, 2, and 1 respectively. The definition implies that any sequence of a single integer is a jolly jumper. You are to write a program to determine whether or not each of a number of sequences is a jolly jumper.

Each line of input contains an integer n < 3000 followed by n integers representing the sequence. For each line of input, generate a line of output saying "Jolly" or "Not jolly".

Sample Input

4 1 4 2 3

5 1 4 2 -1 6

Sample Output

Jolly

Not jolly

解析

题意是给你一个n个元素的序列。每连续的两个元素的差的绝对值要>=1&&<=n-1，并且每个差的绝对值只能出现一次，这样这个序列才是Jolly，否则是Not jolly

思路

再开一个数组val[]，记录每个差值出现的次数

代码

#include<bits/stdc++.h>
#define MAX 10005
using namespace std;
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        int arry[MAX],val[MAX],i;
        for(i=0;i<n;i++)
        {
            scanf("%d",&arry[i]);
        }
        memset(val,0,sizeof(val));
        int flag=1;
        for(i=0;i<n-1;i++)
        {
            int temp=abs(arry[i]-arry[i+1]);
            if(temp>=1&&temp<=n-1)
            {
                val[temp]++;
            }
            else
                flag=0;
        }
        if(flag)
        {
          for(i=1;i<=n-1;i++)
          {
            if(val[i]==0||val[i]>=2)
            {
               flag=0;
               break;
            }
          }
        }
        if(flag)
            printf("Jolly\n");
        else
            printf("Not jolly\n");
    }
    return 0;
}