Together
Time limit : 1sec
Memory limit : 256MB
Description：
You are given an integer sequence of length N, a1,a2,…,aN.
For each 1≤i≤N, you have three choices: add 1 to ai, subtract 1 from ai or do nothing.
After these operations, you select an integer X and count the number of i such that ai=X.
Maximize this count by making optimal choices.
Constraints
1≤N≤10^5
0≤ai<10^5(1≤i≤N)
ai is an integer.
Input
The input is given from Standard Input in the following format:
N
a1 a2 .. aN
Output
Print the maximum possible number of i such that ai=X.
Sample Input
7
3 1 4 1 5 9 2
10
0 1 2 3 4 5 6 7 8 9
1
99999
Sample Output
4
3
1
Source：AC自动机
| 难度等级： | 2 |
| 总通过次数： | 38 |
| 总提交次数： | 168 |