CodeForces 6D Lizards and Basements 2（DFS）

题意：有一串数字，每一次你可以使一个数字减少a，使相邻两个数字减少b，只能操作2-n-1次

思路：直接暴力DFS一波...

#include<bits/stdc++.h>
using namespace std;int ans=1e9,h[15],n,a,b;
vector<int> T,T2;
void dfs(int x,int times)
{if(times>=ans)return;if(x==n){if(h[x]<0){T2=T;ans=times;}return;}for(int i=0;i<=max(h[x-1]/b+1,max(h[x]/a+1,h[x+1]/b+1));i++){if(h[x-1]<b*i){h[x-1]-=b*i;h[x]-=a*i;h[x+1]-=b*i;for(int j=0;j<i;j++)T.push_back(x);dfs(x+1,times+i);for(int j=0;j<i;j++)T.pop_back();h[x-1]+=b*i;h[x]+=a*i;h[x+1]+=b*i;}}
}
int main()
{scanf("%d%d%d",&n,&a,&b);for(int i=1;i<=n;i++)scanf("%d",&h[i]);dfs(2,0);cout<<ans<<endl;for(int i=0;i<T2.size();i++)cout<<T2[i]<<" ";cout<<endl;
}

Description

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.

Input

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 — h₁, h₂, ..., h_n (1 ≤ h_i ≤ 15), where h_i is the amount of health points the i-th archer has.

Output

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.

Sample Input

Input

3 2 1
2 2 2

Output

3
2 2 2

Input

4 3 1
1 4 1 1

Output

4
2 2 3 3

CodeForces 6D Lizards and Basements 2（DFS）相关推荐

CodeForces 6D Lizards and Basements 2 （dfs）
题意:给出一串n个元素序列.a和b,只能选择编号2 ~ n-1的s数字减a,并将相邻两数字减b,要使得所有元素为负,问至少需要多少次选择,选择是怎样的. 题解:dfs 我们可以发现只有2 ~ n-1编 ...
Codeforces 897C Nephren gives a riddle（DFS）
Codeforces:Nephren gives a riddle time limit per test: 2 seconds memory limit per test: 256 megabyte ...
【Codeforces 723D】Lakes in Berland （dfs）
海洋包围的小岛,岛内的有湖,'.'代表水,'*'代表陆地,给出的n*m的地图里至少有k个湖,求填掉面积尽量少的水,使得湖的数量正好为k. dfs找出所有水联通块,判断一下是否是湖(海水区非湖).将湖按 ...
Codeforces 982 C. Cut 'em all!（dfs）
解题思路: 代码中有详细注解,以任意一点为根,dfs遍历这棵树. 每一个节点可能有好几个子树,计算每棵子树含有的节点数,再+1即为这整棵树的节点. 判断子树是否能切断与根之间的联系,如果子树含有偶数个 ...
大盘点|6D姿态估计算法汇总（下）
作者:Tom Hardy Date: 2019-12-28 来源:大盘点|6D姿态估计算法汇总(下)
三十二、图的创建深度优先遍历（DFS）广度优先遍历（BFS）
一.图的基本介绍为什么要有图前面我们学了线性表和树线性表局限于一个直接前驱和一个直接后继的关系树也只能有一个直接前驱也就是父节点当我们需要表示多对多的关系时, 这里我们就用到了图. 图的举例 ...
【 MATLAB 】离散傅里叶级数（DFS）及 IDFS 的 MATLAB 实现
有关离散傅里叶级数(DFS)我之前也写过一些博文,例如:离散周期信号的傅里叶级数(DFS) 这里我再次给出标准公式. 分析式: 其中: 综合式: 这里我必须先声明,关于分析式和综合式前面那个系数1/N ...
部署分布式文件系统（DFS）
部署分布式文件系统(DFS) 使用 DFS 命名空间,可以将位于不同服务器上的共享文件夹组合到一个或多个逻辑结构的命名空间.每个命名空间作为具有一系列子文件夹的单个共享文件夹显示给用户.但是,命名空间 ...
Java实现算法导论中图的广度优先搜索（BFS）和深度优先搜索（DFS）
对算法导论中图的广度优先搜索(BFS)和深度优先搜索(DFS)用Java实现其中的伪代码算法,案例也采用算法导论中的图. import java.util.ArrayList; import java ...

CodeForces 6D Lizards and Basements 2（DFS）

CodeForces 6D Lizards and Basements 2（DFS）相关推荐

最新文章

热门文章