Submission #15423506

---

Source Code Expand

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

#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
using ll = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;

int main() {
  int n,k; cin>>n>>k;
  vector<ull> a(n+1);
  a[0] = 0;
  rep(i, n) {
    ull t; cin>>t;
    a[i+1] = a[i]+t;
  }

  ull prev = a[k] - a[0];

  for(int i = k+1; i <= n; i++) {
    ull cur = a[i] - a[i - k];
    if (prev < cur) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
    prev = cur;
  }
}

Submission Info

Judge Result