Submission #2267738

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }


typedef int VAL;
const int MAX_B = 410000;
const VAL UNITY_SUM = 0;

struct BIT {
	int SIZE_B;
	VAL dat[MAX_B + 1];

	void init(int n = MAX_B) {
		SIZE_B = n;
		for (int i = 0; i <= SIZE_B; ++i) dat[i] = UNITY_SUM;
	}

	inline void add(int a, VAL x) {
		for (int i = a; i <= SIZE_B; i += i & -i)
			dat[i] = dat[i] + x;
	}

	inline VAL sum(int a) {
		VAL res = UNITY_SUM;
		for (int i = a; i > 0; i -= i & -i)
			res = res + dat[i];
		return res;
	}

	inline VAL sum(int a, int b) {
		return sum(b - 1) - sum(a - 1);
	}

	void print() {
		for (int i = 1; i <= SIZE_B; ++i) cout << sum(i, i + 1) << ",";
		cout << endl;
	}
};

BIT bit;




int n, k;
vector<long long> alt;
long long a[210000];

int main() {
  while (cin >> n >> k) {
	if (n == -1) break;
	alt.clear();
	for (int i = 0; i < n; ++i) cin >> a[i], alt.push_back(a[i]);
	sort(alt.begin(), alt.end());
	
	bit.init(n+5);
	int tentou = 0;
	for (int i = 0; i + k < n; ++i) {
	  int val = lower_bound(alt.begin(), alt.end(), a[i+k]) - alt.begin() + 1;
	  int sum = bit.sum(val+1, n+3);
	  tentou += sum;
	  int add = lower_bound(alt.begin(), alt.end(), a[i]) - alt.begin() + 1;
	  bit.add(add, 1);
	}
	
	if (tentou == 0) puts("Yes");
	else puts("No");
  }
}
	
	

Submission Info

Judge Result