ZOJ 1879 — Jolly Jumpers（C++）

#include <iostream>
#include <vector>
#include <algorithm>
#include <stdlib.h>     /* abs */

int isJolly(int a[], int len)
{
std::vector<int> diff;
int tmp;

for(int i = 0; i < len - 1; ++i)
{
tmp = abs(a[i] - a[i + 1]);

diff.push_back(tmp);
}

std::sort(diff.begin(), diff.end());

for(int j = 0; j < len - 1; ++j)
{
if(diff[j] != j + 1)
{
return 0;
}
}

return 1;
}

int main()
{
int len;
int tmp;
int a[3000];

while(std::cin >> len)
{
for(int i = 0; i < len; ++i)
{
std::cin >> tmp;
a[i] = tmp;
}

if(isJolly(a, len))
{
std::cout << "Jolly" << std::endl;
}
else
{
std::cout << "Not jolly" << std::endl;
}
}

return 0;
}