CodeForce Round 579 Div 3 E. Boxers

E. Boxers

Problem

There are $n$ boxers, the weight of the $i^{th}$ boxer is $a_i$. Each of them can change the weight by no more than 1 before the competition (the weight cannot become equal to zero, that is, it must remain positive). Weight is always an integer number.

It is necessary to choose the largest boxing team in terms of the number of people, that all the boxers’ weights in the team are different (i.e. unique).

Write a program that for given current values $a_i$ will find the maximum possible number of boxers in a team.

It is possible that after some change the weight of some boxer is $150001$ (but no more).

Input

The first line contains an integer $n(1\le n\le 150000)$ — the number of boxers. The next line contains $n$ integers $a_1,a_2,\dots ,a_n$, where $a_i(1\le a_i\le 150000)$ is the weight of the $i^{th}$ boxer.

Output

Print a single integer — the maximum possible number of people in a team.

Examples

input

4
3 2 4 1

output

4

input

6
1 1 1 4 4 4

output

5

Note

In the first example, boxers should not change their weights — you can just make a team out of all of them.

In the second example, one boxer with a weight of $1$ can be increased by one (get the weight of $2$), one boxer with a weight of $4$ can be reduced by one, and the other can be increased by one (resulting the boxers with a weight of $3$ and $5$, respectively). Thus, you can get a team consisting of boxers with weights of $5,4,3,2,1$.

想法

小小的贪心

这题言外之意就是要把集中的数分散开来，比如我有3个5,0个4,0个6，也就是5,5,5，那么我可以变成4,5,6

因为每个数只能加一或者减一，那么只要贪心即可

如果当前这个数有0个且下一个数的数目大于0，那么就可以从下一个数变过来一个，即使下一个数的数目因此变成了0也没事，因为大小不同的数的数目没变，也就是说没有恶化答案。

当然还要反向贪心一下

The Code Of My Program

/*********************
*@Author:   ChenShou *
*@Language: C++11    *
*********************/
//#include <bits/stdc++.h> 
#pragma comment(linker, "/STACK:102400000,102400000")
#include<functional>
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<sstream> 
#include<iomanip>
#include<numeric>
#include<cctype>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>

//#define DEBUG
#define RI register int
#define endl "\n"

using namespace std;
typedef long long ll;
//typedef __int128 lll;
//const int N=100000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-9;
const int INF = 0x3f3f3f3f;

inline ll read(){
    long long x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-')
            f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9'){
        x=(x<<1)+(x<<3)+(ch^48);
        ch=getchar();
    }
    return x*f; 
}

int main()
{
#ifdef DEBUG
    freopen("input.in", "r", stdin);
    //freopen("output.out", "w", stdout);
#endif
    //cout.tie(0);
    //ll t ; 
    //scanf("%lld",&t);
    //while(t--){
    //}
    int n;
    n=read();
    int num[150002]={0},sum=0;
    for(int i=0;i<n;i++){
    	int tem=read();
    	num[tem]++;
    }
    for(int i=1;i<150001;i++){
    	if(num[i]==0&&num[i+1]>0)num[i]++,num[i+1]--;
    }
    for(int i=150001;i>=1;i--){
    	if(num[i]==0&&num[i-1]>0)num[i]++,num[i-1]--;
    }
    for(int i=150001;i>=1;i--){
    	if(num[i]>0)sum++;
    }
    printf("%d",sum);
#ifdef DEBUG
    printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
    //cout << "Fuck You !" << endl;
    return 0;
}