The Da Vinci Code

#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) cout << 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 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 INF 2'000'000'000
#define EPS 1e-9
#define PI acos(-1)

void Code_Crush(){
  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
}

ll n, x;
vector < ll > prefix(1e5 + 1);

bool is_good(ll k){
  ll i = k, Max = -INF;
  while(i < sz(prefix))
    Max = max(Max, prefix[i] - prefix[i - k]), i++;
  return Max <= x;
}

ll Binary_Search(){
  ll l = 1, r = sz(prefix) - 1, best = -1;
  while(l <= r){
    ll m = l + (r - l) / 2;
    (is_good(m) ? l = m + 1, best = m : r = m - 1);
  }
  return best;
}

int main(){
  Code_Crush();
  cin >> n >> x;
  prefix.resize(n + 1);
  for(int i = 1, entry; i <= n && cin >> entry; i++) prefix[i] = prefix[i - 1] + entry;
  cout << Binary_Search();
  Time
  return 0;
}