提出 #117552

---

ソースコード 拡げる

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cstdio>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define all(c) (c).begin(), (c).end()
#define iter(c) __typeof((c).begin())
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
const int inf = (1<<28);

int main() {
  int n, k;
  while(cin >> n >> k, !(n==-1 && k==-1)) {
    vector<ull> a(n);
    rep(i, n) cin >> a[i];
    
    if(n == 0) { cout << "Yes" << endl; continue; }
    
    priority_queue<pair<ull, int>, vector<pair<ull, int> >, greater<pair<ull, int> > > rest;
    rep(i, n) rest.push(mp(a[i], i));
    
    bool yes = true;
    
    rep(i, n) {
      while(rest.top().first < a[i]) {
        pair<ull, int> x = rest.top(); rest.pop();
        if(x.second > i+k) yes = false;
      }
    }
    
    cout << (yes ? "Yes" : "No") << endl;
  }
}

提出情報

ジャッジ結果