This documentation is automatically generated by online-judge-tools/verification-helper
This project is maintained by tsutaj
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_3_D" #include <vector> #include <cstdio> using namespace std; using ll = long long int; #define call_from_test #include "../../../structure/disjoint_sparse_table.cpp" #undef call_from_test int main() { int N, L; scanf("%d%d", &N, &L); vector<int> A(N); for(int i=0; i<N; i++) scanf("%d", &A[i]); DisjointSparseTable<int> dst(A, [](int x, int y) { return min(x, y); }); for(int i=0; i<N-L+1; i++) { printf("%d%c", dst.query(i, i+L), " \n"[i == N - L]); } return 0; }
#line 1 "verifying_test/AOJ/DSL_3_D/disjoint_sparse_table.test.cpp" #define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_3_D" #include <vector> #include <cstdio> using namespace std; using ll = long long int; #define call_from_test #line 2 "structure/disjoint_sparse_table.cpp" // @brief Disjoint Sparse Table // @see https://noshi91.hatenablog.com/entry/2018/05/08/183946 // @docs docs/structure/disjoint_sparse_table.md #line 8 "structure/disjoint_sparse_table.cpp" #include <functional> #include <cassert> template <typename Tp> struct DisjointSparseTable { int N, LN; vector<Tp> A; vector< vector<Tp> > seg_l, seg_r; function<Tp(Tp, Tp)> cmb_f; DisjointSparseTable() = default; DisjointSparseTable(vector<Tp> A_, function<Tp(Tp, Tp)> cmb_f_) : A(A_), cmb_f(cmb_f_) { N = A.size(), LN = 1; while((1<<LN) < N) LN++; seg_l.resize(LN, vector<Tp>(N)); seg_r.resize(LN, vector<Tp>(N)); build(A); } void build(const vector<Tp> &A) { for(int i=0; i<LN; i++) { // [j-(1<<i), j), [ j, j+(1<<i) ) for(int j=(1<<i); j<=N; j+=(1<<(i+1))) { if(j < N) seg_r[i][j] = A[j]; for(int k=j+1; k<j+(1<<i); k++) { if(k >= N) break; seg_r[i][k] = cmb_f(seg_r[i][k-1], A[k]); } if(j-1 >= 0) seg_l[i][j-1] = A[j-1]; for(int k=j-2; k>=j-(1<<i); k--) { if(k < 0) break; seg_l[i][k] = cmb_f(seg_l[i][k+1], A[k]); } } } } Tp query(int l, int r) { assert(0 <= l and l < r and r <= N); r--; if(l == r) return A[l]; int k = 31 - __builtin_clz((unsigned int)(l ^ r)); return cmb_f(seg_l[k][l], seg_r[k][r]); } }; #line 10 "verifying_test/AOJ/DSL_3_D/disjoint_sparse_table.test.cpp" #undef call_from_test int main() { int N, L; scanf("%d%d", &N, &L); vector<int> A(N); for(int i=0; i<N; i++) scanf("%d", &A[i]); DisjointSparseTable<int> dst(A, [](int x, int y) { return min(x, y); }); for(int i=0; i<N-L+1; i++) { printf("%d%c", dst.query(i, i+L), " \n"[i == N - L]); } return 0; }