Submission #7080647

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;

int main(){

    ll n, k; cin >> n >> k;

    ll a[n];
    for(int i=0; i<n; i++){
        cin >> a[i];
    }

    bool zero = false;
    for(int i=0; i<n; i++){
        if(a[i] == 0){
            zero = true;
        }
    }
    bool none = true;
    for(int i=0; i<n; i++){
        if(a[i] <= k){
            none = false;
        }
    }


    int ans = 1;
    ll prod = a[0];

    int l = 0, r = 0;
    while(true){

        if(r == n-1){
            break;
        }

        r++;
        prod *= a[r];
        if(prod <= k){
            ans++;
            continue;
        }
        else{
            prod /= a[l];
            l++;
            if(l > r){
                r++;
            }
        }
    }

    if(zero){
        cout << n << endl;
    }
    else if(none){
        cout << 0 << endl;
    }
    else{
        cout << ans << endl;
    }

    return 0;
}

Submission Info

Judge Result