Submission #7092892

---

Source Code Expand

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

int main(){
    int n,k;cin >> n >> k;
    vector<int> s(n);
    for(int i = 0; i < n ;i++)cin >> s[i];

    ll r = 0;
    ll sum = 1;
    ll res = 0;
    for(int l = 0; l < n ; l++){
        if(s[l] == 0){
            cout << n << endl;
            return 0;
        }
        while(sum * s[r] <= k && r < n){
            sum *= s[r];
            r++;
        }
        if(sum > k)break;
        if(r <= l)r = l;
        res = max(res,r-l);
        if(s[l] != 0 && r != l)sum /=s[l];
    }

    cout << res << endl;

    return 0;
}

Submission Info

Judge Result