Verify/LC_cartesian_tree.test.cpp

View this file on GitHub
Last update: 2024-04-26 03:18:17+09:00
Problem: https://judge.yosupo.jp/problem/cartesian_tree

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/cartesian_tree"

#include "Template/template.hpp"

#include "Algorithm/cartesian.hpp"


int main(){
    int n;
    cin>>n;
    vector<int> a(n);
    rep(i,0,n)cin>>a[i];
    auto ret=Cartesian(a);
    rep(i,0,n){
        if(ret[i]==-1)ret[i]=i;
        cout<<ret[i]<<'\n';
    }
    return 0;
}

#line 1 "Verify/LC_cartesian_tree.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/cartesian_tree"

#line 1 "Template/template.hpp"
#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b-1); i >= (int)(a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())

using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;

template <typename T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T, typename U> T ceil(T x, U y) {
    assert(y != 0);
    if (y < 0)
        x = -x, y = -y;
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U> T floor(T x, U y) {
    assert(y != 0);
    if (y < 0)
        x = -x, y = -y;
    return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T> int popcnt(T x) {
    return __builtin_popcountll(x);
}
template <typename T> int topbit(T x) {
    return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <typename T> int lowbit(T x) {
    return (x == 0 ? -1 : __builtin_ctzll(x));
}

#ifdef LOCAL
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define show(...) true
#endif
template <typename T> void _show(int i, T name) {
    cerr << '\n';
}
template <typename T1, typename T2, typename... T3>
void _show(int i, const T1 &a, const T2 &b, const T3 &...c) {
    for (; a[i] != ',' && a[i] != '\0'; i++)
        cerr << a[i];
    cerr << ":" << b << " ";
    _show(i + 1, a, c...);
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << "P(" << p.first << ", " << p.second << ")";
    return os;
}
template <typename T, template <class> class C>
ostream &operator<<(ostream &os, const C<T> &v) {
    os << "[";
    for (auto d : v)
        os << d << ", ";
    os << "]";
    return os;
}
#line 2 "Algorithm/cartesian.hpp"

template <typename T> vector<int> Cartesian(const vector<T> &a) {
    const int n = a.size();
    vector<int> res(n, -1);
    int cur;
    rep(i, 1, n) {
        cur = i - 1;
        if (a[cur] > a[i]) {
            int pre = cur;
            while (cur != -1 and a[cur] > a[i])
                pre = cur, cur = res[cur];
            if (cur == -1) {
                res[i] = -1;
                res[pre] = i;
            } else {
                res[i] = cur;
                res[pre] = i;
            }
        } else
            res[i] = cur;
    }
    return res;
}

/**
 * @brief Cartesian Tree
 * @docs docs/cartesian.md
 */
#line 5 "Verify/LC_cartesian_tree.test.cpp"

int main(){
    int n;
    cin>>n;
    vector<int> a(n);
    rep(i,0,n)cin>>a[i];
    auto ret=Cartesian(a);
    rep(i,0,n){
        if(ret[i]==-1)ret[i]=i;
        cout<<ret[i]<<'\n';
    }
    return 0;
}