Submission #6908020

---

Source Code Expand

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

int main(){
    ll N, K; cin >> N >> K;
    vector<ll> s(N);
    ll mint = 1e9;
    for(int i = 0; i < N; i++){
        cin >> s[i];
        mint = min(mint, s[i]);
        if(s[i] == 0){
            cout << N << endl;
            return 0;
        }
    }
    if(mint > K){
        cout << 0 << endl;
        return 0;
    }
    s.push_back(K+1);
    ll l = 0, r = -1;
    //cout << s[7] << endl;
    ll mul = 1;
    ll ans = 0;

    while(1){
        //cout << "r" << r << endl;
        while(mul <= K){
            r++;
            mul *= s[r];
            //cout << mul << endl;
            if(r == N) break;
        }
        //cout << "r: " << r << endl;
        ans = max(ans, r - l);
        if(r >= N) break;
        while(mul > K){
            mul /= s[l];
            l++;
        }
        //cout << "l: " << l << endl;
    }
    cout << ans << endl;
}

Submission Info

Judge Result