CodeForces - 6D Lizards and Basements 2【DFS】

【题目描述】
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 n integers — 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 1
2 2 2

【样例输出】
3
2 2 2

【样例输入】
4 3 1
1 4 1 1

【样例输出】
4
2 2 3 3

题目链接：https://codeforces.com/contest/6/problem/D

剪完枝暴力搜就是了

代码如下：

#include <bits/stdc++.h>
using namespace std;
static const int MAXN=10;
int n,a,b,ans,h[MAXN+10];
vector<int> v;
vector<int> res;
void dfs(int pos,int cnt,int t1,int t2)
{
    if(pos==n && h[n]-t2<0)
    {
        if(ans>cnt)
        {
            ans=cnt;
            res.clear();
            for(int i=0;i<v.size();i++)
                res.push_back(v[i]);
        }
        return;
    }
    if(cnt>=ans || pos>=n)
        return;
    for(int i=max(0,(h[pos-1]-t1>=0)?(h[pos-1]-t1)/b+1:0);i<=max((h[pos-1]-t1>=0)?(h[pos-1]-t1)/b+1:0,max((h[pos]-t2>=0)?(h[pos]-t2)/a+1:0,(h[pos+1]>=0)?h[pos+1]/b+1:0));i++)
    {
        for(int j=1;j<=i;j++)
            v.push_back(pos);
        dfs(pos+1,cnt+i,t2+i*a,i*b);
        for(int j=1;j<=i;j++)
            v.pop_back();
    }
    return;
}
int main()
{
    cin>>n>>a>>b;
    for(int i=1;i<=n;i++)
        cin>>h[i];
    ans=0x3f3f3f3f;
    dfs(2,0,0,0);
    cout<<ans<<endl;
    for(int i=0;i<res.size();i++)
        cout<<res[i]<<" ";
    cout<<endl;
    return 0;
}