A11756 | Icicles
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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 $n$ icicles dangling from the ceiling located in integer coordinates numbered from $1$ to $n$ . The distance between floor and the $i$ -th icicle is equal to $a_{i}$ .
Andrew is free to choose an arbitrary integer point $T$ in range from $1$ to $n$ inclusive and at time instant $0$ 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 $0$ ) 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 $i$ is $1$ 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 $a_{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 $T$ or report that this mission is impossible.
At the moment the refugee is inside an icy cave with $n$ icicles dangling from the ceiling located in integer coordinates numbered from $1$ to $n$ . The distance between floor and the $i$ -th icicle is equal to $a_{i}$ .
Andrew is free to choose an arbitrary integer point $T$ in range from $1$ to $n$ inclusive and at time instant $0$ 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 $0$ ) 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 $i$ is $1$ 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 $a_{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 $T$ or report that this mission is impossible.
输入格式
The first line contains the number of icicles $n$ $(2<=n<=10^{5})$ .
The next line contains $n$ space-separated numbers $a_{i}$ $(1<=a_{i}<=10^{5})$ — the distances from floor to icicles.
The next line contains $n$ space-separated numbers $a_{i}$ $(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
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 $3$ . Then in two seconds icicles $1$ and $5$ 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 $3$ 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 $2$ and entrap Krakozyabra in $2$ seconds.
In sample case four the answer is impossible.
In sample case two it is optimal to launch the wave from point $2$ and entrap Krakozyabra in $2$ seconds.
In sample case four the answer is impossible.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted