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

#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>

using namespace std;
#define int long long

#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()

template <typename T> void DEBUG(T e) {
  if (DEBUG_OUT == false)
    return;
  std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
  if (DEBUG_OUT == false)
    return;
  for (const auto &e : v) {
    std::cout << e << " ";
  }
  std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
  if (DEBUG_OUT == false)
    return;
  for (const auto &v : vv) {
    DEBUG(v);
  }
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
  if (DEBUG_OUT == false)
    return;
  DEBUG(d);
  DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
  if (flg) {
    cout << hoge << endl;
    abort();
  }
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}
// SOLVE

static int ANS = 0;
void DFS(int V, vector<vector<int>> &GRAPH, vector<int> &used, vector<int> &LIS,
         vector<int> &data, vector<int> &ANS) {
  if (used[V] == 1)
    return;
  used[V] = 1;
  // DEBUG(V);
  int P = data[V];
  auto itr = lower_bound(ALL(LIS), P);
  int mem = *itr;
  *itr = P;
  int SIZE = distance(LIS.begin(), lower_bound(ALL(LIS), INF));
  ANS[V] = SIZE;
  for (int i = 0; i < GRAPH[V].size(); i++) {
    if (used[GRAPH[V][i]] == 0) {
      DFS(GRAPH[V][i], GRAPH, used, LIS, data, ANS);
    }
  }
  *itr = mem;

  return;
}

void solve(void) {
  int N;
  cin >> N;
  vector<int> vec(N, 0);
  for (int i = 0; i < N; i++) {
    cin >> vec[i];
  }
  vector<vector<int>> GRAPH(N);
  for (int i = 0; i < N - 1; i++) {
    int A, B;
    cin >> A >> B;
    A--;
    B--;
    GRAPH[A].push_back(B);
    GRAPH[B].push_back(A);
  }
  vector<int> used(N, 0);
  vector<int> LIS(N + 1, INF);
  vector<int> ANS(N, 0);
  DFS(0, GRAPH, used, LIS, vec, ANS);
  for (int i = 0; i < N; i++) {
    cout << ANS[i] << endl;
  }

  return;
}

int32_t main(int32_t argc, const char *argv[]) {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  std::cout << std::fixed;
  std::cout << std::setprecision(9);
  solve();

  return 0;
}


Error: 0

Fixed submission:

#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>

using namespace std;
#define int long long

#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()

template <typename T> void DEBUG(T e) {
  if (DEBUG_OUT == false)
    return;
  std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
  if (DEBUG_OUT == false)
    return;
  for (const auto &e : v) {
    std::cout << e << " ";
  }
  std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
  if (DEBUG_OUT == false)
    return;
  for (const auto &v : vv) {
    DEBUG(v);
  }
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
  if (DEBUG_OUT == false)
    return;
  DEBUG(d);
  DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
  if (flg) {
    cout << hoge << endl;
    abort();
  }
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}
// SOLVE

static int ANS = 0;
void DFS(int V, vector<vector<int>> &GRAPH, vector<int> &used, vector<int> &LIS,
         vector<int> &data, vector<int> &ANS) {
  if (used[V] == 1)
    return;
  used[V] = 1;
  // DEBUG(V);
  int P = data[V];
  auto itr = lower_bound(ALL(LIS), P);
  int flg = 0;
  int mem = 0;
  if (LIS.end() == itr)
    LIS.push_back(P);
  else {
    mem = *itr;
    *itr = P;
    flg = 1;
  }
  ANS[V] = LIS.size();
  for (int i = 0; i < GRAPH[V].size(); i++) {
    if (used[GRAPH[V][i]] == 0) {
      DFS(GRAPH[V][i], GRAPH, used, LIS, data, ANS);
    }
  }

  if (flg == 0) {
    auto itr2 = LIS.begin();
    itr2 += LIS.size() - 1;
    LIS.erase(itr2);
  } else {
    *itr = mem;
  }

  return;
}

void solve(void) {
  int N;
  cin >> N;
  vector<int> vec(N, 0);
  for (int i = 0; i < N; i++) {
    cin >> vec[i];
  }
  vector<vector<int>> GRAPH(N);
  for (int i = 0; i < N - 1; i++) {
    int A, B;
    cin >> A >> B;
    A--;
    B--;
    GRAPH[A].push_back(B);
    GRAPH[B].push_back(A);
  }
  vector<int> used(N, 0);
  vector<int> LIS;
  vector<int> ANS(N, 0);
  DFS(0, GRAPH, used, LIS, vec, ANS);
  for (int i = 0; i < N; i++) {
    cout << ANS[i] << endl;
  }

  return;
}

int32_t main(int32_t argc, const char *argv[]) {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  std::cout << std::fixed;
  std::cout << std::setprecision(9);
  solve();

  return 0;
}