CF955E.Icicles

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Andrew's favourite Krakozyabra has recenly fled away and now he's eager to bring it back!

At the moment the refugee is inside an icy cave with nn icicles dangling from the ceiling located in integer coordinates numbered from 11 to nn . The distance between floor and the ii -th icicle is equal to aia_{i} .

Andrew is free to choose an arbitrary integer point TT in range from 11 to nn inclusive and at time instant 00 launch a sound wave spreading into both sides (left and right) at the speed of one point per second. Any icicle touched by the wave starts falling at the same speed (that means that in a second the distance from floor to icicle decreases by one but cannot become less that zero). While distance from icicle to floor is more than zero, it is considered passable; as soon as it becomes zero, the icicle blocks the path and prohibits passing.

Krakozyabra is initially (i.e. at time instant 00 ) is located at point and starts running in the right direction at the speed of one point per second. You can assume that events in a single second happen in the following order: first Krakozyabra changes its position, and only then the sound spreads and icicles fall; in particular, that means that if Krakozyabra is currently at point and the falling (i.e. already touched by the sound wave) icicle at point ii is 11 point from the floor, then Krakozyabra will pass it and find itself at and only after that the icicle will finally fall and block the path.

Krakozyabra is considered entrapped if there are fallen (i.e. with ai=0a_{i}=0 ) icicles both to the left and to the right of its current position. Help Andrew find the minimum possible time it takes to entrap Krakozyabra by choosing the optimal value of TT or report that this mission is impossible.

输入格式

The first line contains the number of icicles nn (2<=n<=105)(2<=n<=10^{5}) .

The next line contains nn space-separated numbers aia_{i} (1<=ai<=105)(1<=a_{i}<=10^{5}) — the distances from floor to icicles.

输出格式

Print an only integer — the minimum time it takes to entrap Krakozyabra between two fallen icicles. If it is impossible, print 1-1 .

输入输出样例

  • 输入#1

    5
    1 4 3 5 1
    

    输出#1

    3
    
  • 输入#2

    4
    1 2 1 1
    

    输出#2

    2
    
  • 输入#3

    2
    2 1
    

    输出#3

    3
    
  • 输入#4

    2
    1 2
    

    输出#4

    -1
    

说明/提示

In sample case one it's optimal to launch the sound wave from point 33 . Then in two seconds icicles 11 and 55 will start falling, and in one more seconds they will block the paths. Krakozyabra will be located at at that time. Note that icicle number 33 will also be fallen, so there will actually be two icicles blocking the path to the left.

In sample case two it is optimal to launch the wave from point 22 and entrap Krakozyabra in 22 seconds.

In sample case four the answer is impossible.

首页