Codeforces Beta Round #6 (Div. 2 Only) D. Lizards and Basements 2 dfs

D. Lizards and Basements 2

题目连接：

http://codeforces.com/contest/6/problem/D

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 n integers — h1, h2, ..., hn (1 ≤ hi ≤ 15), where hi 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

3 2 1

2 2 2

Sample Output

3

2 2 2

Hint

题意

你是火系法师，你可以扔火球，你每次可以使得砸中的人掉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;

}