Submission #4014497

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <string>
#include <algorithm>
#include <cmath>
#include <ctype.h>
using namespace std;
#define dump(a) cout << (a) << '\n';
typedef long long Int;
Int mod = 1e9+7;
Int MOD = 998244353;

int main() {
    ios::sync_with_stdio(false);
    Int n, k;
    cin >> n >> k;
    vector<Int> t(n + 1, 0);
    for (Int i = 1; i <= n; i++) cin >> t[i];
    for (Int i = 0; i < n; i++) t[i + 1] += t[i];
    for (Int i = 3; i <= n; i++) {
        if (t[i] - t[i - 3] < k) {
            dump(i);
            return 0;
        }
    }
    dump(-1);
    return 0;  
}

Submission Info

Judge Result