(待做)Codeforces Round.6 D. Lizards and Basements 2 dp
来源:互联网 发布:淘宝全屏店招 编辑:程序博客网 时间:2024/05/22 16:03
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizards and Basements». At the moment he is playing it as a magician. At one of the last levels he has to fight the line of archers. The only spell with which he can damage them is a fire ball. If Polycarp hits the i-th archer with his fire ball (they are numbered from left to right), the archer loses a health points. At the same time the spell damages the archers adjacent to the i-th (if any) — they lose b (1 ≤ b < a ≤ 10) health points each.
As the extreme archers (i.e. archers numbered 1 and n) are very far, the fire ball cannot reach them. Polycarp can hit any other archer with his fire ball.
The amount of health points for each archer is known. An archer will be killed when this amount is less than 0. What is the minimum amount of spells Polycarp can use to kill all the enemies?
Polycarp can throw his fire ball into an archer if the latter is already killed.
The first line of the input contains three integers n, a, b (3 ≤ n ≤ 10; 1 ≤ b < a ≤ 10). The second line contains a sequence of nintegers — h1, h2, ..., hn (1 ≤ hi ≤ 15), where hi is the amount of health points the i-th archer has.
In the first line print t — the required minimum amount of fire balls.
In the second line print t numbers — indexes of the archers that Polycarp should hit to kill all the archers in t shots. All these numbers should be between 2 and n - 1. Separate numbers with spaces. If there are several solutions, output any of them. Print numbers in any order.
3 2 12 2 2
32 2 2
4 3 11 4 1 1
42 2 3 3
- (待做)Codeforces Round.6 D. Lizards and Basements 2 dp
- CodeForces 6D Lizards and Basements 2
- CodeForces 6D Lizards and Basements 2(DFS)
- Codeforces Beta Round #6 (Div. 2 Only) D. Lizards and Basements 2
- Codeforces Beta Round #6 (Div. 2 Only) D. Lizards and Basements 2
- Codeforces 6D Lizards and Basements 2 dfs+暴力
- D. Lizards and Basements 2 (DFS+最优性剪枝)
- Lizards and Basements 2 解题报告
- 【DP】 Codeforces Round #293 (Div. 2) D. Ilya and Escalator
- Codeforces Round #358 (Div. 2) D. Alyona and Strings dp
- Codeforces Round #358 (Div. 2) D. Alyona and Strings dp
- Codeforces Round #399 D-Jon and Orbs(概率DP)
- Codeforces Round #235 (Div. 2) D Roman and Numbers(状态DP)
- Codeforces Round #235 (Div. 2) D. Roman and Numbers (数位dp、状态压缩)
- Codeforces Round #293 (Div. 2) -- D. Ilya and Escalator (DP)
- dp(Codeforces Round #293 (Div. 2)D. Ilya and Escalator)
- Codeforces Round #235 (Div. 2) D. Roman and Numbers(状态压缩DP)
- Codeforces Round #343 (Div. 2) D. Babaei and Birthday Cake(dp、BIT)
- JS类和对象的创建
- 求 一个字符 在二进制表示中1的个数
- NSJSONSerialization
- Android_Dialog_设置Dialog窗口的大小
- 解决Clover启动卡在"root device uuid is ......"的问题
- (待做)Codeforces Round.6 D. Lizards and Basements 2 dp
- 博客总纲
- opencv基础笔记(1)
- 王立平--PopupWindow
- 《C++ concurrency in action》第二章笔记
- VMWare SCSI硬盘识别
- Hduoj1789 【贪心】
- 第9周 项目5 程序填充题(3)
- leetcode - Valid Sudoku