CF--Fence--DP

F. Fence

time limit per test

2 seconds

memory limit per test

256 megabytes

input

input.txt

output

output.txt

Vasya should paint a fence in front of his own cottage. The fence is a sequence of n wooden boards arranged in a single row. Each board is a 1 centimeter wide rectangle. Let's number the board fence using numbers 1, 2, ..., n from left to right. The height of the i-th board is hicentimeters.

Vasya has a 1 centimeter wide brush and the paint of two colors, red and green. Of course, the amount of the paint is limited. Vasya counted the area he can paint each of the colors. It turned out that he can not paint over a square centimeters of the fence red, and he can not paint over b square centimeters green. Each board of the fence should be painted exactly one of the two colors. Perhaps Vasya won't need one of the colors.

In addition, Vasya wants his fence to look smart. To do this, he should paint the fence so as to minimize the value that Vasya called the fence unattractiveness value. Vasya believes that two consecutive fence boards, painted different colors, look unattractive. The unattractiveness value of a fence is the total length of contact between the neighboring boards of various colors. To make the fence look nice, you need to minimize the value as low as possible. Your task is to find what is the minimum unattractiveness Vasya can get, if he paints his fence completely.

The picture shows the fence, where the heights of boards (from left to right) are 2,3,2,4,3,1. The first and the fifth boards are painted red, the others are painted green. The first and the second boards have contact length 2, the fourth and fifth boards have contact length 3, the fifth and the sixth have contact length 1. Therefore, the unattractiveness of the given painted fence is 2+3+1=6.

Input

The first line contains a single integer n (1 ≤ n ≤ 200) — the number of boards in Vasya's fence.

The second line contains two integers a and b (0 ≤ a, b ≤ 4·104) — the area that can be painted red and the area that can be painted green, correspondingly.

The third line contains a sequence of n integers h1, h2, ..., hn (1 ≤ hi ≤ 200) — the heights of the fence boards.

All numbers in the lines are separated by single spaces.

Output

Print a single number — the minimum unattractiveness value Vasya can get if he paints his fence completely. If it is impossible to do, print  - 1.

Examples

input

Copy

4
5 7
3 3 4 1

output

Copy

3

input

Copy

3
2 3
1 3 1

output

Copy

2

input

Copy

3
3 3
2 2 2

output

Copy

-1

给出n个长方形他们的高，宽为1，给出染料可以染的面积（两种，分别为a、b）A值为不同染色之间的面积（就是相邻两个长方形挨着的面积）。问这个值最小多少。

dpijk代表已经染了i个长方形，用了j个a染料，当前染a、b（用0、1代表）。

初始化 dp[0][0][0]=dp[0][0][1]=0;

参考：https://blog.csdn.net/domacles0124/article/details/11616577

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=200+66;
const ll mod=1e9+7;
const int INF=9999999;
int h[maxn];
int s[maxn];
int dp[202][40900][6];
int main()
{
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    int n,a,b;
    scanf("%d %d %d",&n,&a,&b);
    for(int i=1; i<=n; i++)
    {
        scanf("%d",&h[i]);
        s[i]=s[i-1]+h[i];
    }
    for(int i=0; i<=n; i++)
    {
        for(int j=0; j<=a; j++)
        {
            for(int k=0;k<2;k++)
            {
                dp[i][j][k]=INF;
            }
        }
    }
    dp[0][0][0]=dp[0][0][1]=0;
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<=a; j++)
        {
            if(dp[i][j][0]!=INF)//前i面刷了j面红色当前颜色为0（红色）、1
            {
                if(j+h[i+1]<=a)//红的还够用
                {
                    dp[i+1][j+h[i+1]][0]=min(dp[i+1][j+h[i+1]][0],dp[i][j][0]);
                }
                if(s[i+1]-j<=b)
                {
                    dp[i+1][j][1]=min(dp[i][j][0]+min(h[i],h[i+1]),dp[i+1][j][1]);
                }
            }
            if(dp[i][j][1]!=INF)
            {
                int v=dp[i][j][1];
                if(j+h[i+1]<=a)//染红色
                {
                    dp[i+1][j+h[i+1]][0]=min(dp[i+1][j+h[i+1]][0],v+min(h[i],h[i+1]));
                }
                if(s[i+1]-j<=b)
                {
                    dp[i+1][j][1]=min(dp[i+1][j][1],dp[i][j][1]);
                }
            }
        }
    }
    int ans=INF;
    for(int i=0;i<=a;i++)
    {
        for(int j=0;j<2;j++)
        {
            ans=min(ans,dp[n][i][j]);
        }
    }
    printf("%d",ans==INF?-1:ans);
}