Submission #5552596

---

Source Code Expand

#include <iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<queue>
#include<deque>
#include<regex>
#include<stack>
#include<stdio.h>
#include<vector>
#include<set>
#include<map>
#include<iomanip>

#define rep(i, n) for(int i=0;i<n;i++)

typedef int long long ll;
using namespace std;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
static const int MAX = 100;
static const int INF = (1 << 23);

int main() {
    ll n,k;
    cin>>n>>k;
    vector<ll> v(n);
    rep(i,n){cin>>v[i];}


    ll r=0,l=0;
    ll seki=1,ans=0;
    ll len=0;
    seki=1;
    rep(i,n){
        seki*=v[i];
        if(v[i]==0){
            cout<<n<<endl;return 0;
        }
        r++;

        while(l!=r&&seki>k){
            seki/=v[l];
            l++;
        }

        ans=max(ans,r-l);



    }

    cout<<ans<<endl;

    return 0;
}

Submission Info

Judge Result