Codeforces Round 371 (Div. 1)
E
Sonya Partymaker
Codeforces
3300
原题
← D→
翻译中…

Owl Sonya decided to become a partymaker. To train for this role she gather all her owl friends in the country house. There are $*m*$ chairs located in a circle and consequently numbered with integers from $1$ to $*m*$. Thus, chairs $*i*$ and $*i* + 1$ are neighbouring for all $*i*$ from $1$ to $*m* - 1$. Chairs $1$ and $*m*$ are also neighbouring. Some chairs are occupied by her friends. There are $*n*$ friends in total. No two friends occupy the same chair. Rules are the following:

翻译中…
  1. Each participant removes from the game the chair he is currently sitting on.
  2. Each of the participants choose a direction that she will follow: clockwise (indices increase, from $*m*$ goes to $1$) and counter-clockwise (indices decrease, from $1$ goes to $*m*$). This direction may coincide or be different for any pair of owls.
  3. Each turn all guests move one step in the chosen directions. If some guest move to the position with a chair there, he removes this chair from the game.
  4. Game ends if there are no more chairs left in the game.
翻译中…

Owls are very busy and want to get rid of the game as soon as possible. They cooperate to pick the direction. Your goal is to find the minimum number o moves required to finish the game.

翻译中…

Input

翻译中…

The first line of the input contains a single integer $*m*$ ($1 ≤ *m* ≤ 10^{9}$) — the length of the circle.

翻译中…

The second line contains a single integer $*n*$ ($1 ≤ *n* ≤ 100 000$) — the number of friends.

翻译中…

Last line contains an increasing sequence of $*n*$ integers $*a*_{*i*}$ ($1 ≤ *a*_{*i*} ≤ *m*$) — initial positions of all owls.

翻译中…

Output

翻译中…

Print the minimum number of move required to finish the game. Note, that $0$ also may be an answer.

翻译中…

Note

翻译中…

In the first sample, it's possible if all owls will move clockwise, i.e. in the direction of increasing indices.

翻译中…

In the sample, first owl has to move clockwise, while the second — counterclockwise.

翻译中…

In the third sample, the first and the fourth owls should move counterclockwise, while the third and the sixth — clockwise. The second and the firth may move in any direction.

翻译中…

样例

Input #1
6
3
1 3 5
Output #1
1
InputCopy OutputCopy
Input #2
6
2
1 6
Output #2
2
InputCopy OutputCopy
Input #3
406
6
1 2 3 204 205 206
Output #3
100
InputCopy OutputCopy
题目信息
题号
713E
时间限制
1.5 s
内存限制
256 MB
标签
二分
动态规划

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。