Together

AtCoder

IDarc082_a

Time2000ms

Memory256MB

Difficulty—

You are given an integer sequence of length $N$, $a_1,a_2,...,a_N$. For each $1≤i≤N$, you have three choices: add $1$ to $a_i$, subtract $1$ from $a_i$ or do nothing. After these operations, you select an integer $X$ and count the number of $i$ such that $a_i=X$. Maximize this count by making optimal choices. ## Constraints * $1≤N≤10^5$ * $0≤a_i<10^5 (1≤i≤N)$ * $a_i$ is an integer. ## Input The input is given from Standard Input in the following format: $N$ $a_1$ $a_2$ .. $a_N$ [samples]

Samples

Input #1

7
3 1 4 1 5 9 2

Output #1

4

For example, turn the sequence into $2,2,3,2,6,9,2$ and select $X=2$ to obtain $4$, the maximum possible count.

Input #2

10
0 1 2 3 4 5 6 7 8 9

Output #2

Input #3

1
99999

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Together",
    "description": {
      "content": "You are given an integer sequence of length $N$, $a_1,a_2,...,a_N$. For each $1≤i≤N$, you have three choices: add $1$ to $a_i$, subtract $1$ from $a_i$ or do nothing. After these operations, you selec",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "arc082_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given an integer sequence of length $N$, $a_1,a_2,...,a_N$.\nFor each $1≤i≤N$, you have three choices: add $1$ to $a_i$, subtract $1$ from $a_i$ or do nothing.\nAfter these operations, you selec...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments