Submission #6911706

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  int n, k; cin >> n >> k;
  V<> a(n); for (auto&& e : a) cin >> e;
  if (find(begin(a), end(a), 0) != end(a)) {
    return cout << n << '\n', 0;
  }
  int r = 0, res = 0;
  lint p = 1;
  for (int l = 0; l < n; ++l) {
    while (r < n and p * a[r] <= k) {
      p *= a[r++];
    }
    res = max(res, r - l);
    if (l < r) {
      p /= a[l];
    } else {
      r = l + 1;
    }
  }
  cout << res << '\n';
}

Submission Info

Judge Result