A15030 | Make it Increasing
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an array $a$ consisting of $n$ positive integers, and an array $b$ , with length $n$ . Initially $b_i=0$ for each $1 \leq i \leq n$ .
In one move you can choose an integer $i$ ( $1 \leq i \leq n$ ), and add $a_i$ to $b_i$ or subtract $a_i$ from $b_i$ . What is the minimum number of moves needed to make $b$ increasing (that is, every element is strictly greater than every element before it)?
In one move you can choose an integer $i$ ( $1 \leq i \leq n$ ), and add $a_i$ to $b_i$ or subtract $a_i$ from $b_i$ . What is the minimum number of moves needed to make $b$ increasing (that is, every element is strictly greater than every element before it)?
输入格式
The first line contains a single integer $n$ ( $2 \leq n \leq 5000$ ).
The second line contains $n$ integers, $a_1$ , $a_2$ , ..., $a_n$ ( $1 \leq a_i \leq 10^9$ ) — the elements of the array $a$ .
The second line contains $n$ integers, $a_1$ , $a_2$ , ..., $a_n$ ( $1 \leq a_i \leq 10^9$ ) — the elements of the array $a$ .
输出格式
Print a single integer, the minimum number of moves to make $b$ increasing.
输入输出样例
输入 #1
5 1 2 3 4 5
输出 #1
4
输入 #2
7 1 2 1 2 1 2 1
输出 #2
10
输入 #3
8 1 8 2 7 3 6 4 5
输出 #3
16
Example $1$ : you can subtract $a_1$ from $b_1$ , and add $a_3$ , $a_4$ , and $a_5$ to $b_3$ , $b_4$ , and $b_5$ respectively. The final array will be \[ $-1$ , $0$ , $3$ , $4$ , $5$ \] after $4$ moves.
Example $2$ : you can reach \[ $-3$ , $-2$ , $-1$ , $0$ , $1$ , $2$ , $3$ \] in $10$ moves.
Example $2$ : you can reach \[ $-3$ , $-2$ , $-1$ , $0$ , $1$ , $2$ , $3$ \] in $10$ moves.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted