Submission #606660

---

Source Code Expand

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

#define rep(i,n) for(int i=0;i<(n);++i)
#define loop for(;;)
#define trace(var) cerr<<">>> "<<#var<<" = "<<var<<endl;
#define all(v) begin(v),end(v)
#define pb push_back
#define inf (1e9)
#define eps (1e-9)
using Integer = long long;
using Real = long double;
const Real PI = acosl(-1);
using P = pair<int, int>;

template<class S, class T> inline
ostream& operator<<(ostream&os, pair<S,T> p) {
  return os << '(' << p.first << ", " << p.second << ')';
}

template<class T, class U> inline
ostream& operator<<(ostream&os, tuple<T,U> t) {
  return os << '('
    << get<0>(t) << ", "
    << get<1>(t) << ')';
}

template<class S, class T, class U> inline
ostream& operator<<(ostream&os, tuple<S,T,U> t) {
  return os << '('
    << get<0>(t) << ", "
    << get<1>(t) << ", "
    << get<2>(t) << ')';
}

template<class T> inline
ostream& operator<<(ostream&os, set<T> v) {
  os << "(set";
  for (T item: v) os << ' ' << item;
  os << ")";
  return os;
}

template<class T> inline
ostream& operator<<(ostream&os, vector<T> v) {
  if (v.size() == 0) { return os << "(empty)"; }
  os << v[0];
  for (int i=1, len=v.size(); i<len; ++i) os << ' ' << v[i];
  return os;
}

template<class T> inline
istream& operator>>(istream&is, vector<T>&v) {
  rep (i, v.size()) is >> v[i];
  return is;
}

//           ^   >  v   <
int dx[] = { -1, 0, 1,  0 };
int dy[] = {  0, 1, 0, -1 };

using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vb = vector<bool>;
const string A = "Takahashi";
const string B = "Aoki";

int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout.setf(ios::fixed);
  cout.precision(10);
  random_device dev;
  mt19937 rand(dev());

  int n, k;
  cin >> n >> k;
  vi s(n);
  cin >> s;

  {
    int mr = 0;
    int ren = 0;
    rep (i, n) {
      if (s[i] == 0) {
        ++ren;
        mr = max(mr, ren);
      } else {
        ren=0;
      }
    }
    if (mr > 0) {
      cout << n << endl;
      return 0;
    }
    if (k == 0) {
      cout << mr << endl;
      return 0;
    }
  }

  Integer ans = 0;
  Integer ac = s[0];
  if (ac <= k) ans = 1;
  int j = 0;
  int len = 1;
  for (int i = 1; i < n; ++i) {
      ac *= s[i];
      ++len;
      while (ac > k) {
        --len;
        ac /= s[j];
        ++j;
      }
    ans = max<Integer>(ans, len);
  }
  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result