Submission #609110

---

Source Code Expand

#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <list>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <iterator> 

typedef long long ll;

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

using namespace std;

#define MAX_N 100000

int N, K;
bool zero_flg = false;
ll s[MAX_N];

void solve() {
    int left = 0, right = 0;
    int ans = 0;
    ll temp = 1;
    while (right < N) {
        while (temp <= K and right <= N) {
            right += 1;
            temp *= s[right - 1];
        } 
        ans = max(ans, right - left - 1);
        if (temp / s[left] < 1) {
            temp = 1;
        } else {
            temp = temp / s[left];
        }
        left += 1;
        if (right < left) {
            right = left;
        }
    }
    cout << ans << endl;
}

int main(int argc, char const* argv[])
{
    cin >> N >> K;
    REP(i, N) cin >> s[i];
    REP(i, N) {
        cin >> s[i];
        if (s[i] == 0) {
            zero_flg = true;
        }
    }
    if (zero_flg) {
        cout << N << endl;
    } else {
        solve();
    }
    return 0;
}

Submission Info

Judge Result