Submission #3770176

---

Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;

long long s[100010];

int main() {
  int N;
  long long K;
  cin >> N >> K;
  bool zero = false;
  for (int i = 0; i < N; i++) {
    cin >> s[i];
    if (s[i] == 0) zero = true;
  }
  int ans = 0;
  long long product = 1;
  int start = 0;
  int end = 0;
  for (int end = 0; end < N; end++) {
    product *= s[end];
    if (product > K) {
      product /= s[start];
      start++;
    }
    ans = max(ans, end - start + 1);
  }
  if (zero) ans = N;
  cout << ans << endl;
}

Submission Info

Judge Result