Problem C: Jolly Jumpers

Problem C: Jolly Jumpers

时间: 1ms        内存:128M

描述:

Problem C: Jolly Jumpers

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".

输入:

输出:

示例输入:

4 1 4 2 3
5 1 4 2 -1 6

示例输出:

Jolly
Not jolly

提示:

参考答案(内存最优[1500]):

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#define MAX 3001
using namespace std;
int s[MAX];
bool app[MAX];
int main()
{
    int n;
    while(cin>>n)
    {
        int i;
        memset(app,0,n+1);
        for(i=0;i<n;++i)
            scanf("%d",&s[i]);
        for(i=1;i<n;++i)
        {
            int t=fabs(s[i]-s[i-1]);
            if(t>=n||t<=0)break;
            if(app[t])break;
            app[t]=true;
        }
        if(n==i)cout<<"Jolly"<<endl;
        else cout<<"Not jolly"<<endl;
    }
    return 0;
}

参考答案(时间最优[4]):

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#define MAX 3001
using namespace std;
int s[MAX];
bool app[MAX];
int main()
{
    int n;
    while(cin>>n)
    {
        int i;
        memset(app,0,n+1);
        for(i=0;i<n;++i)
            scanf("%d",&s[i]);
        for(i=1;i<n;++i)
        {
            int t=fabs(s[i]-s[i-1]);
            if(t>=n||t<=0)break;
            if(app[t])break;
            app[t]=true;
        }
        if(n==i)cout<<"Jolly"<<endl;
        else cout<<"Not jolly"<<endl;
    }
    return 0;
}

题目和答案均来自于互联网,仅供参考,如有问题请联系管理员修改或删除。

点赞

发表评论

电子邮件地址不会被公开。必填项已用 * 标注