A15969 | Array Painting
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an array of $n$ integers, where each integer is either $0$ , $1$ , or $2$ . Initially, each element of the array is blue.
Your goal is to paint each element of the array red. In order to do so, you can perform operations of two types:
- pay one coin to choose a blue element and paint it red;
- choose a red element which is not equal to $0$ and a blue element adjacent to it, decrease the chosen red element by $1$ , and paint the chosen blue element red.
What is the minimum number of coins you have to spend to achieve your goal?
Your goal is to paint each element of the array red. In order to do so, you can perform operations of two types:
- pay one coin to choose a blue element and paint it red;
- choose a red element which is not equal to $0$ and a blue element adjacent to it, decrease the chosen red element by $1$ , and paint the chosen blue element red.
What is the minimum number of coins you have to spend to achieve your goal?
输入格式
The first line contains one integer $n$ ( $1 \le n \le 2 \cdot 10^5$ ).
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $0 \le a_i \le 2$ ).
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $0 \le a_i \le 2$ ).
输出格式
Print one integer — the minimum number of coins you have to spend in order to paint all elements red.
输入输出样例
输入 #1
3 0 2 0
输出 #1
1
输入 #2
4 0 0 1 1
输出 #2
2
输入 #3
7 0 1 0 0 1 0 2
输出 #3
4
In the first example, you can paint all elements red with having to spend only one coin as follows:
1. paint the $2$ -nd element red by spending one coin;
2. decrease the $2$ -nd element by $1$ and paint the $1$ -st element red;
3. decrease the $2$ -nd element by $1$ and paint the $3$ -rd element red.
In the second example, you can paint all elements red spending only two coins as follows:
1. paint the $4$ -th element red by spending one coin;
2. decrease the $4$ -th element by $1$ and paint the $3$ -rd element red;
3. paint the $1$ -st element red by spending one coin;
4. decrease the $3$ -rd element by $1$ and paint the $2$ -nd element red.
1. paint the $2$ -nd element red by spending one coin;
2. decrease the $2$ -nd element by $1$ and paint the $1$ -st element red;
3. decrease the $2$ -nd element by $1$ and paint the $3$ -rd element red.
In the second example, you can paint all elements red spending only two coins as follows:
1. paint the $4$ -th element red by spending one coin;
2. decrease the $4$ -th element by $1$ and paint the $3$ -rd element red;
3. paint the $1$ -st element red by spending one coin;
4. decrease the $3$ -rd element by $1$ and paint the $2$ -nd element red.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted