Submission #3392417

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
#define all(x) x.begin(),x.end()

int main(){
  int N,K;
  cin >> N >> K;
  vector<i64> t(N);
  rep(i,0,N - 1) cin >> t[i];
  i64 now = t[0] + t[1] + t[2];
  if(now > K){
    cout << 3 << endl;
    return 0;
  }
  rep(i,3,N - 1){
    now += t[i] - t[i - 3];
    if(now > K){
      cout << i + 1 << endl;
      return 0;
    }
  }
  cout << -1 << endl;
}

Submission Info

Judge Result