Problem p02537 (C++) — buggy submission, verdict: Runtime Error

#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
// #include <numeric> //iota
// #include <sstream>
// #include <cstring>
// #include <tuple>
// #include <random>
// #include <string>
// #include <unordered_set>
// #include <bitset>
// #include <unordered_map>
// #include <stack>
// #include <cmath>
// #include <deque>
// #include <queue>
// #include <list>
#include <array>

using namespace std;
#define all(x) (x).begin(), (x).end()
#define vec vector
#define pb push_back
#define pp pop_back
#define fi first
#define IOS                                                                    \\
  ios::sync_with_stdio(0);                                                     \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
#define se second
#define un_map unordered_map
#define rep(i, a, n) for (int i = a; i < n; ++i)
#define inc_rep(i, a, n, inc) for (int i = a; i < n; i += inc)
#define couts(x) cout << x << "\\n"
#define watch(x) cout << #x << " : " << x << endl;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLII;
template <typename T> void print(vector<T> &v) {
  rep(i, 0, (int)v.size()) cout << v[i] << " ";
  cout << endl;
}
int nxt() {
  int x;
  cin >> x;
  return x;
}
ll nxtl() {
  ll x;
  cin >> x;
  return x;
}
string nxts() {
  string x;
  cin >> x;
  return x;
}
double nxtd() {
  double x;
  cin >> x;
  return x;
}

void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\\'' << x << '\\''; }
void __print(const char *x) { cerr << '\\"' << x << '\\"'; }
void __print(const string &x) { cerr << '\\"' << x << '\\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template <typename T, typename V> void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T> void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x)
    cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v))
    cerr << ", ";
  _print(v...);
}

#ifndef ONLINE_JUDGE
#define debug(x...)                                                            \\
  cerr << "[" << #x << "] = [";                                                \\
  _print(x)
#else
#define debug(x...)
#endif

ll power_mod(ll a, ll b, ll mo) {
  ll ans = 1;
  while (b) {
    if (b & 1) {
      ans = (ans % mo * a % mo) % mo;
    }
    a = (a % mo * a % mo) % mo;
    b /= 2;
  }
  return ans;
}
ll POW(ll a, ll b) {
  ll ans = 1;
  while (b) {
    if (b & 1) {
      ans = ans * a;
    }
    a = a * a;
    b /= 2;
  }
  return ans;
}

// string int_to_string(int x) {
// stringstream ss;
// ss << x;
// string ni = ss.str();
// return ni;
//}

// int string_to_int(string x) {
// int n;
// stringstream s(x);
// s >> n;
// return n;
//}

// char int_to_char(int a) {
// return a + '0';
//}

// void INVERSE() {
// fact[0] = 1;
// for (ll i = 1; i <= z; ++i) {
// fact[i] = (fact[i - 1] * i) % mod;
//}
// inv[0] = 1;
// inv[1] = 1;
// for (ll i = 2; i <= z; ++i) {
// inv[i] = (mod - (mod / i) * inv[mod % i] % mod) % mod;
//}
// mul[0] = 1;
// for (int i = 1; i <= z; ++i) {
// mul[i] = (mul[i - 1] * inv[i]) % mod;
//}
//}

// read questions carefully , write clean code and check your logic again on WA
// !!!

// problems are not difficult just make sure you understand the qusetion and
// just think smartly (make sure to use pen and paper when needed)

int const p = 300000;
int dp[p + 1];
int v[p + 1];
int segment_tree[4 * p + 2];
int n, k;
int sized = p;
int query(int l_in, int r_in, int index = 1, int l = 1, int r = sized) {
  if (r_in >= r && l_in <= l) {
    return segment_tree[index];
  }
  if (l_in > r || r_in < l) {
    return 0;
  }
  int mid = (l + r) / 2;
  return max(query(l_in, r_in, index * 2, l, mid),
             query(l_in, r_in, index * 2 + 1, mid + 1, r));
}

void update(int index_in, int val, int index = 1, int l = 1, int r = sized) {
  if (l == r) {
    segment_tree[index] = val;
    return;
  }
  int mid = (l + r) / 2;
  if (index_in <= mid) {
    update(index_in, val, index * 2, l, mid);
  } else {
    update(index_in, val, index * 2 + 1, mid + 1, r);
  }
  segment_tree[index] =
      max(segment_tree[index * 2], segment_tree[index * 2 + 1]);
}

int main() {
  cin >> n >> k;
  for (int i = 0; i < n; ++i) {
    cin >> v[i];
    v[i]++;
  }
  for (int i = n - 1; i >= 0; --i) {
    int r = (v[i] + k >= p) ? p : v[i] + k;
    int l = (v[i] - k >= 1) ? v[i] - k : 1;
    int val = query(l, r);
    dp[v[i]] = val + 1;
    update(v[i], dp[v[i]]);
  }
  int maxm = 0;
  for (int i = 0; i <= p; ++i)
    maxm = max(maxm, dp[i]);
  cout << maxm;
}


Error: WA

Fixed submission:

#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
// #include <numeric> //iota
// #include <sstream>
// #include <cstring>
// #include <tuple>
// #include <random>
// #include <string>
// #include <unordered_set>
// #include <bitset>
// #include <unordered_map>
// #include <stack>
// #include <cmath>
// #include <deque>
// #include <queue>
// #include <list>
#include <array>

using namespace std;
#define all(x) (x).begin(), (x).end()
#define vec vector
#define pb push_back
#define pp pop_back
#define fi first
#define IOS                                                                    \\
  ios::sync_with_stdio(0);                                                     \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
#define se second
#define un_map unordered_map
#define rep(i, a, n) for (int i = a; i < n; ++i)
#define inc_rep(i, a, n, inc) for (int i = a; i < n; i += inc)
#define couts(x) cout << x << "\\n"
#define watch(x) cout << #x << " : " << x << endl;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLII;
template <typename T> void print(vector<T> &v) {
  rep(i, 0, (int)v.size()) cout << v[i] << " ";
  cout << endl;
}
int nxt() {
  int x;
  cin >> x;
  return x;
}
ll nxtl() {
  ll x;
  cin >> x;
  return x;
}
string nxts() {
  string x;
  cin >> x;
  return x;
}
double nxtd() {
  double x;
  cin >> x;
  return x;
}

void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\\'' << x << '\\''; }
void __print(const char *x) { cerr << '\\"' << x << '\\"'; }
void __print(const string &x) { cerr << '\\"' << x << '\\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template <typename T, typename V> void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T> void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x)
    cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v))
    cerr << ", ";
  _print(v...);
}

#ifndef ONLINE_JUDGE
#define debug(x...)                                                            \\
  cerr << "[" << #x << "] = [";                                                \\
  _print(x)
#else
#define debug(x...)
#endif

ll power_mod(ll a, ll b, ll mo) {
  ll ans = 1;
  while (b) {
    if (b & 1) {
      ans = (ans % mo * a % mo) % mo;
    }
    a = (a % mo * a % mo) % mo;
    b /= 2;
  }
  return ans;
}
ll POW(ll a, ll b) {
  ll ans = 1;
  while (b) {
    if (b & 1) {
      ans = ans * a;
    }
    a = a * a;
    b /= 2;
  }
  return ans;
}

// string int_to_string(int x) {
// stringstream ss;
// ss << x;
// string ni = ss.str();
// return ni;
//}

// int string_to_int(string x) {
// int n;
// stringstream s(x);
// s >> n;
// return n;
//}

// char int_to_char(int a) {
// return a + '0';
//}

// void INVERSE() {
// fact[0] = 1;
// for (ll i = 1; i <= z; ++i) {
// fact[i] = (fact[i - 1] * i) % mod;
//}
// inv[0] = 1;
// inv[1] = 1;
// for (ll i = 2; i <= z; ++i) {
// inv[i] = (mod - (mod / i) * inv[mod % i] % mod) % mod;
//}
// mul[0] = 1;
// for (int i = 1; i <= z; ++i) {
// mul[i] = (mul[i - 1] * inv[i]) % mod;
//}
//}

// read questions carefully , write clean code and check your logic again on WA
// !!!

// problems are not difficult just make sure you understand the qusetion and
// just think smartly (make sure to use pen and paper when needed)

int const p = 300000;
int dp[p + 1];
int v[p + 1];
int segment_tree[2 * p + 2];
int n, k;
int sized = p;
int query(int l_in, int r_in, int index = 1, int l = 1, int r = sized) {
  if (r_in >= r && l_in <= l) {
    return segment_tree[index];
  }
  if (l_in > r || r_in < l) {
    return 0;
  }
  int mid = (l + r) / 2;
  return max(query(l_in, r_in, index * 2, l, mid),
             query(l_in, r_in, index * 2 + 1, mid + 1, r));
}

void update(int index_in, int val, int index = 1, int l = 1, int r = sized) {
  if (l == r) {
    segment_tree[index] = val;
    return;
  }
  int mid = (l + r) / 2;
  if (index_in <= mid) {
    update(index_in, val, index * 2, l, mid);
  } else {
    update(index_in, val, index * 2 + 1, mid + 1, r);
  }
  segment_tree[index] =
      max(segment_tree[index * 2], segment_tree[index * 2 + 1]);
}

int main() {
  cin >> n >> k;
  for (int i = 0; i < n; ++i) {
    cin >> v[i];
    v[i]++;
  }
  for (int i = n - 1; i >= 0; --i) {
    int r = (v[i] + k >= p) ? p : v[i] + k;
    int l = (v[i] - k >= 1) ? v[i] - k : 1;
    int val = query(l, r);
    dp[v[i]] = val + 1;
    update(v[i], dp[v[i]]);
  }
  int maxm = 0;
  for (int i = 0; i <= p; ++i)
    maxm = max(maxm, dp[i]);
  cout << maxm;
}