Cutting

#include <bits/stdc++.h>
using namespace std;

#define cin(vec) for(auto& i : vec) cin >> i
#define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
#define cout(vec) for(auto& i : vec) cout << i << " "; cout << "\n";
#define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
#define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
#define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
#define fixed(n) fixed << setprecision(n)
#define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define fill(vec, value) memset(vec, value, sizeof(vec));
#define Num_of_Digits(n) ((int)log10(n)+1)
#define mod_combine(a, b, m) (((a % m) * (b % m)) % m)
#define all(vec) vec.begin(),vec.end()
#define rall(vec) vec.rbegin(),vec.rend()
#define sz(x) int(x.size())
#define TC int t; cin >> t;   while(t--)
#define fi first
#define se second
#define Pair pair < int, int >
#define ll long long
#define ull unsigned long long
#define Mod  1'000'000'007
#define OO 2'000'000'000
#define EPS 1e-9
#define PI acos(-1)

void AhMeD_HoSSaM(){
  ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  #endif
}

int main(){
  AhMeD_HoSSaM();
  int n, b;
  cin >> n >> b;
  vector < int > nums(n), cut;
  vector < Pair > prefix(n), postfix(n);
  cin(nums);
  for(int i = 0; i < n; i++){
    if(i > 0)
      prefix[i].fi += prefix[i - 1].fi, prefix[i].se += prefix[i - 1].se;
    (nums[i] & 1 ? prefix[i].fi++ : prefix[i].se++);
  }
  for(int i = n - 1; i >= 0; i--){
    if(i < n - 1)
      postfix[i].fi += postfix[i + 1].fi, postfix[i].se += postfix[i + 1].se;
    (nums[i] & 1 ? postfix[i].fi++ : postfix[i].se++);
  }
  for(int i = 1; i < n - 1; i++){
    if(postfix[i + 1].fi == postfix[i + 1].se && prefix[i].fi == prefix[i].se)
      cut.push_back(abs(nums[i] - nums[i + 1]));
  }
  sort(all(cut));
  int idx = 0;
  while(idx < sz(cut)){
    if(cut[idx] > b) break;
    b -= cut[idx++];
  }
  cout << idx << "\n";
  Time
  return 0;
}