Codeforces Round #212 (Div. 2) B. Petya and Staircases

题意就是：一个人在跳台阶，一次可以向上跳一个或者是跨过一个或者两个。但是有一些比较脏的台阶他不会去调，判断他是否可以跳到第n个台阶。开始的时候在第一个台阶。

注意：第一个台阶和第n个台阶如果是脏的话，他不会跳到最后的台阶上的。除了前面的之后就是求连续区间的长度是不是大于等于3。

B. Petya and Staircases

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Little boy Petya loves stairs very much. But he is bored from simple going up and down them — he loves jumping over several stairs at a time. As he stands on some stair, he can either jump to the next one or jump over one or two stairs at a time. But some stairs are too dirty and Petya doesn't want to step on them.

Now Petya is on the first stair of the staircase, consisting of n stairs. He also knows the numbers of the dirty stairs of this staircase. Help Petya find out if he can jump through the entire staircase and reach the last stair number n without touching a dirty stair once.

One has to note that anyway Petya should step on the first and last stairs, so if the first or the last stair is dirty, then Petya cannot choose a path with clean steps only.

Input

The first line contains two integers n and m (1 ≤ n ≤ 10⁹, 0 ≤ m ≤ 3000) — the number of stairs in the staircase and the number of dirty stairs, correspondingly. The second line contains m different space-separated integers d₁, d₂, ..., d_m (1 ≤ d_i ≤ n) — the numbers of the dirty stairs (in an arbitrary order).

Output

Print "YES" if Petya can reach stair number n, stepping only on the clean stairs. Otherwise print "NO".

Sample test(s)

input

10 5
2 4 8 3 6

output

NO

input

10 5
2 4 5 7 9

output

YES

#include <stdio.h>
#include <iostream>
#include <string.h>
#include <string>
#include <cmath>
#include <algorithm>

using namespace std;

int main()
{
    int f[15000], n, m, i, j;
    int flat , sum;
    while(cin >>n>>m)
    {
        flat = 0;
        int a = 0;
        for(i = 0; i < m; i++)
        {
            cin >>f[i];
            if(f[i] > a)
                a = f[i];
        }
        sort(f, f+m);
        if(a == n || f[0] == 1)
        {
            cout <<"NO"<<endl;
           continue;
        }
        int _max = -1;
        for(i = 0; i < m-1; i++)
        {
            int k = i;
            sum = 1;
            for(j = i+1; j < m; j++)
            {
                if(f[j]-f[k] == 1)
                {
                    k++;
                    sum ++;
                }
                else
                    break;
            }
            if(_max < sum)
                _max = sum;
        }
        if(_max > 2)
            cout <<"NO"<<endl;
        else
            cout <<"YES"<<endl;
    }
    return 0;
}