#410377 (C++17(gcc12)) No.878 Range High-Element Query

• 問題: No.878 Range High-Element Query
• ユーザー: firiexp
• 提出日時: 2019-12-19 13:15:43
• 言語: C++17(gcc12) (gcc 12.4.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 51 ms / 2,000 ms
• コード長: 3,190 bytes
• コンパイル時間: 746 ms
• コンパイル使用メモリ: 115,700 KB
• 実行使用メモリ: 11,904 KB
• 最終ジャッジ日時: 2026-03-08 19:30:44
• 合計ジャッジ時間: 2,091 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

ファイルパターン	結果
sample	AC * 1
other	AC * 18

コンパイルメッセージ

main.cpp: In function ‘int main()’:
main.cpp:94:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   94 |     for (auto &&i : v) scanf("%d", &i);
      |                        ~~~~~^~~~~~~~~~
main.cpp:109:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  109 |         int tmp, l, r; scanf("%d %d %d", &tmp, &l, &r);
      |                        ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

ソースコード

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

template <class M>
struct SegmentTree{
    using T = typename M::T;
    int sz;
    vector<T> seg;
    explicit SegmentTree(int n) {
        sz = 1;
        while(sz < n) sz <<= 1;
        seg.assign(2*sz, M::e());
    }

    void set(int k, const T &x){ seg[k + sz] = x; }

    void build(){
        for (int i = sz-1; i > 0; --i) seg[i] = M::f(seg[2*i], seg[2*i+1]);
    }

    void update(int k, const T &x){
        k += sz;
        seg[k] = x;
        while (k >>= 1) seg[k] = M::f(seg[2*k], seg[2*k+1]);
    }

    T query(int a, int b){
        if(sz <= a) return M::e();
        T l = M::e(), r = M::e();
        for(a += sz, b += sz; a < b; a >>=1, b>>=1){
            if(a & 1) l = M::f(l, seg[a++]);
            if(b & 1) r = M::f(seg[--b], r);
        }
        return M::f(l, r);
    }

    template<typename C>
    int find(int t, C &c, T &val, int k, int l, int r){
        if(r-l == 1){
            val = f(val, seg[k]);
            return c(val) ? k-sz : -1;
        }
        int m = (l+r) >> 1;
        if(m <= t) return find(t, c, val, (k << 1) | 1, m, r);
        if(t <= l && !c(val = f(val, seg[k]))) return -1;
        int lv = find(t, c, val, (k << 1) | 0 , l, m);
        if(~lv) return lv;
        return find(t, c, val, (k << 1) | 1, m, r);
    }

    template<typename C>
    int find(int t, C &c){
        T val = M::e();
        return find(t, c, val, 1, 0, sz);
    }
    T operator[](const int &k) const { return seg[k + sz]; }
};


struct Monoid{
    using T = int;
    static T f(T a, T b) { return min(a, b); }
    static T e() { return INF<int>; }
};

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }

int main() {
    int n, q;
    cin >> n >> q;
    vector<int> v(n);
    for (auto &&i : v) scanf("%d", &i);
    auto nxt = make_v(18, n, INF<int>);
    SegmentTree<Monoid> seg(n);
    for (int i = n - 1; i >= 0; --i) {
        nxt[0][i] = seg.query(v[i], n);
        seg.update(v[i]-1, i);
    }
    for (int i = 0; i < 17; ++i) {
        for (int j = 0; j < n; ++j) {
            if(nxt[i][j] != INF<int>){
                nxt[i+1][j] = nxt[i][nxt[i][j]];
            }
        }
    }
    for (int i = 0; i < q; ++i) {
        int tmp, l, r; scanf("%d %d %d", &tmp, &l, &r);
        l--;
        int ans = 1;
        for (int j = 17; j >= 0; --j) {
            if(nxt[j][l] < r){
                l = nxt[j][l];
                ans += (1 << j);
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}