結果
問題 | No.2433 Min Increasing Sequence |
ユーザー |
![]() |
提出日時 | 2023-08-18 21:22:58 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 45 ms / 2,000 ms |
コード長 | 24,482 bytes |
コンパイル時間 | 3,428 ms |
コンパイル使用メモリ | 278,792 KB |
実行使用メモリ | 11,008 KB |
最終ジャッジ日時 | 2024-11-28 05:31:27 |
合計ジャッジ時間 | 5,357 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 32 |
ソースコード
#line 1 "/home/maspy/compro/library/my_template.hpp"#if defined(LOCAL)#include <my_template_compiled.hpp>#else#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;using ll = long long;using u32 = unsigned int;using u64 = unsigned long long;using i128 = __int128;using u128 = unsigned __int128;using f128 = __float128;template <class T>constexpr T infty = 0;template <>constexpr int infty<int> = 1'000'000'000;template <>constexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;template <>constexpr u32 infty<u32> = infty<int>;template <>constexpr u64 infty<u64> = infty<ll>;template <>constexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;template <>constexpr double infty<double> = infty<ll>;template <>constexpr long double infty<long double> = infty<ll>;using pi = pair<ll, ll>;using vi = vector<ll>;template <class T>using vc = vector<T>;template <class T>using vvc = vector<vc<T>>;template <class T>using vvvc = vector<vvc<T>>;template <class T>using vvvvc = vector<vvvc<T>>;template <class T>using vvvvvc = vector<vvvvc<T>>;template <class T>using pq = priority_queue<T>;template <class T>using pqg = priority_queue<T, vector<T>, greater<T>>;#define vv(type, name, h, ...) \vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define vvv(type, name, h, w, ...) \vector<vector<vector<type>>> name( \h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define vvvv(type, name, a, b, c, ...) \vector<vector<vector<vector<type>>>> name( \a, vector<vector<vector<type>>>( \b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))// https://trap.jp/post/1224/#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)#define overload4(a, b, c, d, e, ...) e#define overload3(a, b, c, d, ...) d#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)#define FOR_subset(t, s) \for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))#define all(x) x.begin(), x.end()#define len(x) ll(x.size())#define elif else if#define eb emplace_back#define mp make_pair#define mt make_tuple#define fi first#define se second#define stoi stollint popcnt(int x) { return __builtin_popcount(x); }int popcnt(u32 x) { return __builtin_popcount(x); }int popcnt(ll x) { return __builtin_popcountll(x); }int popcnt(u64 x) { return __builtin_popcountll(x); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T, typename U>T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}template <typename T, typename U>T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}template <typename T, typename U>pair<T, T> divmod(T x, U y) {T q = floor(x, y);return {q, x - q * y};}template <typename T, typename U>T SUM(const vector<U> &A) {T sum = 0;for (auto &&a: A) sum += a;return sum;}#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define UNIQUE(x) \sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()template <typename T>T POP(deque<T> &que) {T a = que.front();que.pop_front();return a;}template <typename T>T POP(pq<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T POP(pqg<T> &que) {assert(!que.empty());T a = que.top();que.pop();return a;}template <typename T>T POP(vc<T> &que) {assert(!que.empty());T a = que.back();que.pop_back();return a;}template <typename F>ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {if (check_ok) assert(check(ok));while (abs(ok - ng) > 1) {auto x = (ng + ok) / 2;tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));}return ok;}template <typename F>double binary_search_real(F check, double ok, double ng, int iter = 100) {FOR(iter) {double x = (ok + ng) / 2;tie(ok, ng) = (check(x) ? mp(x, ng) : mp(ok, x));}return (ok + ng) / 2;}template <class T, class S>inline bool chmax(T &a, const S &b) {return (a < b ? a = b, 1 : 0);}template <class T, class S>inline bool chmin(T &a, const S &b) {return (a > b ? a = b, 1 : 0);}// ? は -1vc<int> s_to_vi(const string &S, char first_char) {vc<int> A(S.size());FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }return A;}template <typename T, typename U>vector<T> cumsum(vector<U> &A, int off = 1) {int N = A.size();vector<T> B(N + 1);FOR(i, N) { B[i + 1] = B[i] + A[i]; }if (off == 0) B.erase(B.begin());return B;}// stable sorttemplate <typename T>vector<int> argsort(const vector<T> &A) {vector<int> ids(len(A));iota(all(ids), 0);sort(all(ids),[&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });return ids;}// A[I[0]], A[I[1]], ...template <typename T>vc<T> rearrange(const vc<T> &A, const vc<int> &I) {vc<T> B(len(I));FOR(i, len(I)) B[i] = A[I[i]];return B;}#endif#line 1 "/home/maspy/compro/library/other/io.hpp"// based on yosupo's fastio#include <unistd.h>namespace fastio {#define FASTIO// クラスが read(), print() を持っているかを判定するメタ関数struct has_write_impl {template <class T>static auto check(T &&x) -> decltype(x.write(), std::true_type{});template <class T>static auto check(...) -> std::false_type;};template <class T>class has_write : public decltype(has_write_impl::check<T>(std::declval<T>())) {};struct has_read_impl {template <class T>static auto check(T &&x) -> decltype(x.read(), std::true_type{});template <class T>static auto check(...) -> std::false_type;};template <class T>class has_read : public decltype(has_read_impl::check<T>(std::declval<T>())) {};struct Scanner {FILE *fp;char line[(1 << 15) + 1];size_t st = 0, ed = 0;void reread() {memmove(line, line + st, ed - st);ed -= st;st = 0;ed += fread(line + ed, 1, (1 << 15) - ed, fp);line[ed] = '\0';}bool succ() {while (true) {if (st == ed) {reread();if (st == ed) return false;}while (st != ed && isspace(line[st])) st++;if (st != ed) break;}if (ed - st <= 50) {bool sep = false;for (size_t i = st; i < ed; i++) {if (isspace(line[i])) {sep = true;break;}}if (!sep) reread();}return true;}template <class T, enable_if_t<is_same<T, string>::value, int> = 0>bool read_single(T &ref) {if (!succ()) return false;while (true) {size_t sz = 0;while (st + sz < ed && !isspace(line[st + sz])) sz++;ref.append(line + st, sz);st += sz;if (!sz || st != ed) break;reread();}return true;}template <class T, enable_if_t<is_integral<T>::value, int> = 0>bool read_single(T &ref) {if (!succ()) return false;bool neg = false;if (line[st] == '-') {neg = true;st++;}ref = T(0);while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }if (neg) ref = -ref;return true;}template <typename T,typename enable_if<has_read<T>::value>::type * = nullptr>inline bool read_single(T &x) {x.read();return true;}bool read_single(double &ref) {string s;if (!read_single(s)) return false;ref = std::stod(s);return true;}bool read_single(char &ref) {string s;if (!read_single(s) || s.size() != 1) return false;ref = s[0];return true;}template <class T>bool read_single(vector<T> &ref) {for (auto &d: ref) {if (!read_single(d)) return false;}return true;}template <class T, class U>bool read_single(pair<T, U> &p) {return (read_single(p.first) && read_single(p.second));}template <size_t N = 0, typename T>void read_single_tuple(T &t) {if constexpr (N < std::tuple_size<T>::value) {auto &x = std::get<N>(t);read_single(x);read_single_tuple<N + 1>(t);}}template <class... T>bool read_single(tuple<T...> &tpl) {read_single_tuple(tpl);return true;}void read() {}template <class H, class... T>void read(H &h, T &... t) {bool f = read_single(h);assert(f);read(t...);}Scanner(FILE *fp) : fp(fp) {}};struct Printer {Printer(FILE *_fp) : fp(_fp) {}~Printer() { flush(); }static constexpr size_t SIZE = 1 << 15;FILE *fp;char line[SIZE], small[50];size_t pos = 0;void flush() {fwrite(line, 1, pos, fp);pos = 0;}void write(const char val) {if (pos == SIZE) flush();line[pos++] = val;}template <class T, enable_if_t<is_integral<T>::value, int> = 0>void write(T val) {if (pos > (1 << 15) - 50) flush();if (val == 0) {write('0');return;}if (val < 0) {write('-');val = -val; // todo min}size_t len = 0;while (val) {small[len++] = char(0x30 | (val % 10));val /= 10;}for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }pos += len;}void write(const string s) {for (char c: s) write(c);}void write(const char *s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) write(s[i]);}void write(const double x) {ostringstream oss;oss << fixed << setprecision(15) << x;string s = oss.str();write(s);}void write(const long double x) {ostringstream oss;oss << fixed << setprecision(15) << x;string s = oss.str();write(s);}template <typename T,typename enable_if<has_write<T>::value>::type * = nullptr>inline void write(T x) {x.write();}template <class T>void write(const vector<T> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write(' ');write(val[i]);}}template <class T, class U>void write(const pair<T, U> val) {write(val.first);write(' ');write(val.second);}template <size_t N = 0, typename T>void write_tuple(const T t) {if constexpr (N < std::tuple_size<T>::value) {if constexpr (N > 0) { write(' '); }const auto x = std::get<N>(t);write(x);write_tuple<N + 1>(t);}}template <class... T>bool write(tuple<T...> tpl) {write_tuple(tpl);return true;}template <class T, size_t S>void write(const array<T, S> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) write(' ');write(val[i]);}}void write(i128 val) {string s;bool negative = 0;if (val < 0) {negative = 1;val = -val;}while (val) {s += '0' + int(val % 10);val /= 10;}if (negative) s += "-";reverse(all(s));if (len(s) == 0) s = "0";write(s);}};Scanner scanner = Scanner(stdin);Printer printer = Printer(stdout);void flush() { printer.flush(); }void print() { printer.write('\n'); }template <class Head, class... Tail>void print(Head &&head, Tail &&... tail) {printer.write(head);if (sizeof...(Tail)) printer.write(' ');print(forward<Tail>(tail)...);}void read() {}template <class Head, class... Tail>void read(Head &head, Tail &... tail) {scanner.read(head);read(tail...);}} // namespace fastiousing fastio::print;using fastio::flush;using fastio::read;#define INT(...) \int __VA_ARGS__; \read(__VA_ARGS__)#define LL(...) \ll __VA_ARGS__; \read(__VA_ARGS__)#define STR(...) \string __VA_ARGS__; \read(__VA_ARGS__)#define CHAR(...) \char __VA_ARGS__; \read(__VA_ARGS__)#define DBL(...) \double __VA_ARGS__; \read(__VA_ARGS__)#define VEC(type, name, size) \vector<type> name(size); \read(name)#define VV(type, name, h, w) \vector<vector<type>> name(h, vector<type>(w)); \read(name)void YES(bool t = 1) { print(t ? "YES" : "NO"); }void NO(bool t = 1) { YES(!t); }void Yes(bool t = 1) { print(t ? "Yes" : "No"); }void No(bool t = 1) { Yes(!t); }void yes(bool t = 1) { print(t ? "yes" : "no"); }void no(bool t = 1) { yes(!t); }#line 2 "/home/maspy/compro/library/ds/segtree/segtree.hpp"template <class Monoid>struct SegTree {using MX = Monoid;using X = typename MX::value_type;using value_type = X;vc<X> dat;int n, log, size;SegTree() {}SegTree(int n) { build(n); }template <typename F>SegTree(int n, F f) {build(n, f);}SegTree(const vc<X>& v) { build(v); }void build(int m) {build(m, [](int i) -> X { return MX::unit(); });}void build(const vc<X>& v) {build(len(v), [&](int i) -> X { return v[i]; });}template <typename F>void build(int m, F f) {n = m, log = 1;while ((1 << log) < n) ++log;size = 1 << log;dat.assign(size << 1, MX::unit());FOR(i, n) dat[size + i] = f(i);FOR_R(i, 1, size) update(i);}X get(int i) { return dat[size + i]; }vc<X> get_all() { return {dat.begin() + size, dat.begin() + size + n}; }void update(int i) { dat[i] = Monoid::op(dat[2 * i], dat[2 * i + 1]); }void set(int i, const X& x) {assert(i < n);dat[i += size] = x;while (i >>= 1) update(i);}void multiply(int i, const X& x) {assert(i < n);i += size;dat[i] = Monoid::op(dat[i], x);while (i >>= 1) update(i);}X prod(int L, int R) {assert(0 <= L && L <= R && R <= n);X vl = Monoid::unit(), vr = Monoid::unit();L += size, R += size;while (L < R) {if (L & 1) vl = Monoid::op(vl, dat[L++]);if (R & 1) vr = Monoid::op(dat[--R], vr);L >>= 1, R >>= 1;}return Monoid::op(vl, vr);}X prod_all() { return dat[1]; }template <class F>int max_right(F check, int L) {assert(0 <= L && L <= n && check(Monoid::unit()));if (L == n) return n;L += size;X sm = Monoid::unit();do {while (L % 2 == 0) L >>= 1;if (!check(Monoid::op(sm, dat[L]))) {while (L < size) {L = 2 * L;if (check(Monoid::op(sm, dat[L]))) { sm = Monoid::op(sm, dat[L++]); }}return L - size;}sm = Monoid::op(sm, dat[L++]);} while ((L & -L) != L);return n;}template <class F>int min_left(F check, int R) {assert(0 <= R && R <= n && check(Monoid::unit()));if (R == 0) return 0;R += size;X sm = Monoid::unit();do {--R;while (R > 1 && (R % 2)) R >>= 1;if (!check(Monoid::op(dat[R], sm))) {while (R < size) {R = 2 * R + 1;if (check(Monoid::op(dat[R], sm))) { sm = Monoid::op(dat[R--], sm); }}return R + 1 - size;}sm = Monoid::op(dat[R], sm);} while ((R & -R) != R);return 0;}// prod_{l<=i<r} A[i xor x]X xor_prod(int l, int r, int xor_val) {static_assert(Monoid::commute);X x = Monoid::unit();for (int k = 0; k < log + 1; ++k) {if (l >= r) break;if (l & 1) { x = Monoid::op(x, dat[(size >> k) + ((l++) ^ xor_val)]); }if (r & 1) { x = Monoid::op(x, dat[(size >> k) + ((--r) ^ xor_val)]); }l /= 2, r /= 2, xor_val /= 2;}return x;}};#line 2 "/home/maspy/compro/library/alg/monoid/min.hpp"template <typename E>struct Monoid_Min {using X = E;using value_type = X;static constexpr X op(const X &x, const X &y) noexcept { return min(x, y); }static constexpr X unit() { return infty<E>; }static constexpr bool commute = true;};#line 2 "/home/maspy/compro/library/ds/segtree/dual_segtree.hpp"template <typename Monoid>struct Dual_SegTree {using MA = Monoid;using A = typename MA::value_type;int n, log, size;vc<A> laz;Dual_SegTree() : Dual_SegTree(0) {}Dual_SegTree(int n) { build(n); }void build(int m) {n = m;log = 1;while ((1 << log) < n) ++log;size = 1 << log;laz.assign(size << 1, MA::unit());}A get(int p) {assert(0 <= p && p < n);p += size;for (int i = log; i >= 1; i--) push(p >> i);return laz[p];}vc<A> get_all() {FOR(i, size) push(i);return {laz.begin() + size, laz.begin() + size + n};}void apply(int l, int r, const A& a) {assert(0 <= l && l <= r && r <= n);if (l == r) return;l += size, r += size;if (!MA::commute) {for (int i = log; i >= 1; i--) {if (((l >> i) << i) != l) push(l >> i);if (((r >> i) << i) != r) push((r - 1) >> i);}}while (l < r) {if (l & 1) all_apply(l++, a);if (r & 1) all_apply(--r, a);l >>= 1, r >>= 1;}}private:void push(int k) {if (laz[k] == MA::unit()) return;all_apply(2 * k, laz[k]), all_apply(2 * k + 1, laz[k]);laz[k] = MA::unit();}void all_apply(int k, A a) { laz[k] = MA::op(laz[k], a); }};#line 2 "/home/maspy/compro/library/mod/modint_common.hpp"struct has_mod_impl {template <class T>static auto check(T &&x) -> decltype(x.get_mod(), std::true_type{});template <class T>static auto check(...) -> std::false_type;};template <class T>class has_mod : public decltype(has_mod_impl::check<T>(std::declval<T>())) {};template <typename mint>mint inv(int n) {static const int mod = mint::get_mod();static vector<mint> dat = {0, 1};assert(0 <= n);if (n >= mod) n %= mod;while (len(dat) <= n) {int k = len(dat);int q = (mod + k - 1) / k;dat.eb(dat[k * q - mod] * mint::raw(q));}return dat[n];}template <typename mint>mint fact(int n) {static const int mod = mint::get_mod();assert(0 <= n && n < mod);static vector<mint> dat = {1, 1};while (len(dat) <= n) dat.eb(dat[len(dat) - 1] * mint::raw(len(dat)));return dat[n];}template <typename mint>mint fact_inv(int n) {static vector<mint> dat = {1, 1};if (n < 0) return mint(0);while (len(dat) <= n) dat.eb(dat[len(dat) - 1] * inv<mint>(len(dat)));return dat[n];}template <class mint, class... Ts>mint fact_invs(Ts... xs) {return (mint(1) * ... * fact_inv<mint>(xs));}template <typename mint, class Head, class... Tail>mint multinomial(Head &&head, Tail &&... tail) {return fact<mint>(head) * fact_invs<mint>(std::forward<Tail>(tail)...);}template <typename mint>mint C_dense(int n, int k) {static vvc<mint> C;static int H = 0, W = 0;auto calc = [&](int i, int j) -> mint {if (i == 0) return (j == 0 ? mint(1) : mint(0));return C[i - 1][j] + (j ? C[i - 1][j - 1] : 0);};if (W <= k) {FOR(i, H) {C[i].resize(k + 1);FOR(j, W, k + 1) { C[i][j] = calc(i, j); }}W = k + 1;}if (H <= n) {C.resize(n + 1);FOR(i, H, n + 1) {C[i].resize(W);FOR(j, W) { C[i][j] = calc(i, j); }}H = n + 1;}return C[n][k];}template <typename mint, bool large = false, bool dense = false>mint C(ll n, ll k) {assert(n >= 0);if (k < 0 || n < k) return 0;if constexpr (dense) return C_dense<mint>(n, k);if constexpr (!large) return multinomial<mint>(n, k, n - k);k = min(k, n - k);mint x(1);FOR(i, k) x *= mint(n - i);return x * fact_inv<mint>(k);}template <typename mint, bool large = false>mint C_inv(ll n, ll k) {assert(n >= 0);assert(0 <= k && k <= n);if (!large) return fact_inv<mint>(n) * fact<mint>(k) * fact<mint>(n - k);return mint(1) / C<mint, 1>(n, k);}// [x^d] (1-x) ^ {-n} の計算template <typename mint, bool large = false, bool dense = false>mint C_negative(ll n, ll d) {assert(n >= 0);if (d < 0) return mint(0);if (n == 0) { return (d == 0 ? mint(1) : mint(0)); }return C<mint, large, dense>(n + d - 1, d);}#line 3 "/home/maspy/compro/library/mod/modint.hpp"template <int mod>struct modint {static constexpr u32 umod = u32(mod);static_assert(umod < u32(1) << 31);u32 val;static modint raw(u32 v) {modint x;x.val = v;return x;}constexpr modint() : val(0) {}constexpr modint(u32 x) : val(x % umod) {}constexpr modint(u64 x) : val(x % umod) {}constexpr modint(int x) : val((x %= mod) < 0 ? x + mod : x){};constexpr modint(ll x) : val((x %= mod) < 0 ? x + mod : x){};bool operator<(const modint &other) const { return val < other.val; }modint &operator+=(const modint &p) {if ((val += p.val) >= umod) val -= umod;return *this;}modint &operator-=(const modint &p) {if ((val += umod - p.val) >= umod) val -= umod;return *this;}modint &operator*=(const modint &p) {val = u64(val) * p.val % umod;return *this;}modint &operator/=(const modint &p) {*this *= p.inverse();return *this;}modint operator-() const { return modint::raw(val ? mod - val : u32(0)); }modint operator+(const modint &p) const { return modint(*this) += p; }modint operator-(const modint &p) const { return modint(*this) -= p; }modint operator*(const modint &p) const { return modint(*this) *= p; }modint operator/(const modint &p) const { return modint(*this) /= p; }bool operator==(const modint &p) const { return val == p.val; }bool operator!=(const modint &p) const { return val != p.val; }modint inverse() const {int a = val, b = mod, u = 1, v = 0, t;while (b > 0) {t = a / b;swap(a -= t * b, b), swap(u -= t * v, v);}return modint(u);}modint pow(ll n) const {assert(n >= 0);modint ret(1), mul(val);while (n > 0) {if (n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}#ifdef FASTIOvoid write() { fastio::printer.write(val); }void read() {fastio::scanner.read(val);val %= mod;}#endifstatic constexpr int get_mod() { return mod; }// (n, r), r は 1 の 2^n 乗根static constexpr pair<int, int> ntt_info() {if (mod == 167772161) return {25, 17};if (mod == 469762049) return {26, 30};if (mod == 754974721) return {24, 362};if (mod == 880803841) return {23, 211};if (mod == 998244353) return {23, 31};if (mod == 1045430273) return {20, 363};if (mod == 1051721729) return {20, 330};if (mod == 1053818881) return {20, 2789};return {-1, -1};}static constexpr bool can_ntt() { return ntt_info().fi != -1; }};using modint107 = modint<1000000007>;using modint998 = modint<998244353>;#line 2 "/home/maspy/compro/library/alg/monoid/add.hpp"template <typename X>struct Monoid_Add {using value_type = X;static constexpr X op(const X &x, const X &y) noexcept { return x + y; }static constexpr X inverse(const X &x) noexcept { return -x; }static constexpr X power(const X &x, ll n) noexcept { return X(n) * x; }static constexpr X unit() { return X(0); }static constexpr bool commute = true;};#line 8 "main.cpp"using mint = modint998;void solve() {LL(N);VEC(ll, A, N);reverse(all(A));SegTree<Monoid_Min<ll>> seg_1(A);Dual_SegTree<Monoid_Add<mint>> dp(N + 1);dp.apply(0, 1, 1);FOR(i, N) {mint x = dp.get(i);ll now = seg_1.prod(0, i);int j = seg_1.max_right([&](auto e) -> bool {if (e == infty<ll>) return 1;return e > now;},i);// j より右にdp.apply(j + 1, N + 1, x);}print(dp.get(N));}signed main() {int T = 1;// INT(T);FOR(T) solve();return 0;}