998B Cutting

B. Cutting

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There are a lot of things which could be cut — trees, paper, "the rope". In this problem you are going to cut a sequence of integers.

There is a sequence of integers, which contains the equal number of even and odd numbers. Given a limited budget, you need to make maximum possible number of cuts such that each resulting segment will have the same number of odd and even integers.

Cuts separate a sequence to continuous (contiguous) segments. You may think about each cut as a break between two adjacent elements in a sequence. So after cutting each element belongs to exactly one segment. Say, $[4,1,2,3,4,5,4,4,5,5]$ $\to$ two cuts $\to$ $[4,1|2,3,4,5|4,4,5,5]$. On each segment the number of even elements should be equal to the number of odd elements.

The cost of the cut between $x$ and $y$ numbers is $|x-y|$ bitcoins. Find the maximum possible number of cuts that can be made while spending no more than $B$ bitcoins.

Input

First line of the input contains an integer $n$ ($2\le n\le 100$) and an integer $B$ ($1\le B\le 100$) — the number of elements in the sequence and the number of bitcoins you have.

Second line contains $n$ integers: $a_1$, $a_2$, ..., $a_n$ ($1\le a_i\le 100$) — elements of the sequence, which contains the equal number of even and odd numbers

Output

Print the maximum possible number of cuts which can be made while spending no more than $B$ bitcoins.

Examples

input

Copy

6 4
1 2 5 10 15 20

output

Copy

1

input

Copy

4 10
1 3 2 4

output

Copy

0

input

Copy

6 100
1 2 3 4 5 6

output

Copy

2

Note

In the first sample the optimal answer is to split sequence between $2$ and $5$. Price of this cut is equal to $3$ bitcoins.

In the second sample it is not possible to make even one cut even with unlimited number of bitcoins.

In the third sample the sequence should be cut between $2$ and $3$, and between $4$ and $5$. The total price of the cuts is $1+1=2$ bitcoins.

题意：给出一段数列，里面有N个数ai，奇数个数和偶数个数相同，然后你可以在奇数和偶数个数相等的时候，你就可以剪一个片段，需要花费|a[i]-a[i+1]|。现在总共预算是b，让你在b预算内，尽可能的多剪片段，输出最多的剪的次数。

题解：贪心  先把所有能减的片段，奇数和偶数个数相等的时候，把花费存起来，然后排个序，从前面累加，如果没有超出预算b剪的次数就++

c++：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,m,a[110],ans=0,cnt1=0,cnt2=0,b[110],c=0,sum=0;
    cin>>n>>m;
    for(int i=0;i<n;i++)
         cin>>a[i];
    for(int i=0;i<n;i++)
    {
        if(a[i]%2) cnt1++;
         else cnt2++;
         if(cnt1==cnt2&&i+1<n)
           b[c++]=abs(a[i]-a[i+1]);
    }
    sort(b,b+c);
    for(int i=0;i<c;i++)
    {
        sum+=b[i];
        if(sum<=m)
            ans++;
        else break;
    }
    cout<<ans;
    return 0;
}

python：

n,m=map(int,input().split())
a=list(map(int,input().split()))
b=[]
cnt1=0;cnt2=0
for i in range(len(a)):
    if a[i]%2==0:cnt1+=1
    else:cnt2+=1
    if cnt1==cnt2 and i+1<len(a):
        b.append(abs(a[i]-a[i+1]))
b.sort()
sum=0;ans=0
for i in b:
    sum+=i
    if sum<=m:
        ans+=1
    else:
       break
print(ans)