Problems/E.boxers.cpp at master · shashank077/Problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <string>
#include <cstring>
#include <set>
#include <map>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<int,pair<int,int>> piii;
typedef vector<int> vi;
typedef vector<pii> vii;

#define ri(a) scanf("%d", &a);
#define rii(a,b) scanf("%d %d", &a, &b);
#define riii(a,b,c) scanf("%d %d %d", &a, &b, &c);
#define rl(a) scanf("%lld", &a);
#define rll(a,b) scanf("%lld %lld", &a, &b);

const int INF = 0x3f3f3f3f;
const ll LLINF = 1e18;
const int maxN = 150005; // CAMBIAR ESTE

// GJNM
int arr[maxN];

int main()
{
	int n;
	ri(n);
	for (int i = 0; i < n; ++i)
	{
		ri(arr[i]);
	}
	sort(arr,arr+n,greater<int>());
	map<int,bool> mp;
	for (int i = 0; i < n; ++i)
	{
		if ( mp.find(arr[i]+1) == mp.end()) mp[arr[i]+1] = true;
		else if ( mp.find(arr[i]) == mp.end()) mp[arr[i]] = true;
		else if ( mp.find(arr[i]-1) == mp.end() && arr[i] != 1) mp[arr[i]-1] = true;
	}
	printf("%d\n", (int)mp.size());
	return 0;
}