CodeForces 653A【水】

sort一发，去重

#include<cstdio>#include<iostream>#include<queue>#include<string.h>#include<string>#include<map>#include<algorithm>using namespace std;const int N=55;int a[N];int n;int main(){    scanf("%d",&n);    for(int i=1;i<=n;i++)        scanf("%d",&a[i]);    sort(a+1,a+n+1);    unique(a+1,a+n+1);    for(int i=1;i+2<=n;i++)    {        if((a[i+1]-a[i])!=1||(a[i+2]-a[i+1])!=1)            continue;        puts("YES");        return 0;    }    puts("NO");    return 0;}