Submission #3768668

---

Source Code Expand

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

int main(){
  long n,k,o = 0;
  cin >> n >> k;
  vector<long> s(n);
  for(int i = 0;i < n;i++){
    cin >> s.at(i);
    if(s.at(i) == 0){
      o = 1;
    }
  }
  long m = 1,kekka = -1,cur = 0,right = 0,left = 0;
  while(right < n && o != 1 && k != 0){
    if(m <= k){
      right++;
      cur++;
      m *= s.at(right-1);
    }
    if(m > k){
      m /= s.at(left);
      cur--;
      left++;
    }
    kekka = max(cur,kekka);
  }
  if(o == 1){
    cout << n << endl;
  }
  else if(k != 0){
    cout << kekka << endl;
  }
  else{
    cout << 0 << endl;
  }
}

Submission Info

Judge Result