You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
34 lines
905 B
C++
34 lines
905 B
C++
#define _CRT_SECURE_NO_WARNINGS
|
|
#define _SILENCE_CXX17_C_HEADER_DEPRECATION_WARNING
|
|
#include <bits/stdc++.h>
|
|
using namespace std;
|
|
#define CRP(t, x) const t &x
|
|
#define OPL(t, x) bool operator<(CRP(t, x)) const
|
|
#define FIL(x, v) memset(x, v, sizeof(x))
|
|
#define CLR(x) FIL(x, 0)
|
|
#define NE1(x) FIL(x, -1)
|
|
#define INF(x) FIL(x, 0x3f)
|
|
#ifndef _DEBUG
|
|
#define _DEBUG 0
|
|
#endif // !_DEBUG
|
|
#define IFD if (_DEBUG)
|
|
typedef long long ll, i64;
|
|
const int N = 15e4 + 50;
|
|
int a[N];
|
|
bool b[N];
|
|
int main()
|
|
{
|
|
int n;
|
|
scanf("%d", &n);
|
|
for (int i = 0; i < n; i++) scanf("%d", a + i);
|
|
sort(a, a + n);
|
|
for (int i = 0; i < n; i++)
|
|
if (a[i] > 1 && !b[a[i] - 1])
|
|
b[a[i] - 1] = true;
|
|
else if (!b[a[i]])
|
|
b[a[i]] = true;
|
|
else if (!b[a[i] + 1])
|
|
b[a[i] + 1] = true;
|
|
printf("%d", accumulate(b, b + N, 0));
|
|
return 0;
|
|
} |