結果

問題 No.992 最長増加部分列の数え上げ
ユーザー 👑 emthrmemthrm
提出日時 2020-02-14 23:19:44
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 184 ms / 2,000 ms
コード長 8,839 bytes
コンパイル時間 2,827 ms
コンパイル使用メモリ 218,460 KB
実行使用メモリ 11,508 KB
最終ジャッジ日時 2024-10-06 13:20:13
合計ジャッジ時間 9,384 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 2 ms
6,816 KB
testcase_04 AC 64 ms
6,816 KB
testcase_05 AC 47 ms
6,816 KB
testcase_06 AC 82 ms
6,816 KB
testcase_07 AC 58 ms
6,820 KB
testcase_08 AC 30 ms
6,820 KB
testcase_09 AC 59 ms
6,820 KB
testcase_10 AC 79 ms
6,816 KB
testcase_11 AC 103 ms
7,224 KB
testcase_12 AC 19 ms
6,820 KB
testcase_13 AC 55 ms
6,816 KB
testcase_14 AC 55 ms
6,816 KB
testcase_15 AC 20 ms
6,820 KB
testcase_16 AC 164 ms
10,156 KB
testcase_17 AC 29 ms
6,816 KB
testcase_18 AC 53 ms
6,816 KB
testcase_19 AC 101 ms
7,092 KB
testcase_20 AC 181 ms
10,540 KB
testcase_21 AC 180 ms
10,608 KB
testcase_22 AC 184 ms
10,484 KB
testcase_23 AC 184 ms
10,480 KB
testcase_24 AC 183 ms
10,488 KB
testcase_25 AC 180 ms
10,616 KB
testcase_26 AC 179 ms
10,608 KB
testcase_27 AC 180 ms
10,356 KB
testcase_28 AC 180 ms
10,488 KB
testcase_29 AC 181 ms
10,480 KB
testcase_30 AC 138 ms
10,348 KB
testcase_31 AC 140 ms
10,224 KB
testcase_32 AC 141 ms
10,096 KB
testcase_33 AC 136 ms
10,220 KB
testcase_34 AC 134 ms
10,220 KB
testcase_35 AC 136 ms
10,220 KB
testcase_36 AC 136 ms
10,096 KB
testcase_37 AC 137 ms
10,224 KB
testcase_38 AC 137 ms
10,220 KB
testcase_39 AC 137 ms
10,096 KB
testcase_40 AC 145 ms
11,428 KB
testcase_41 AC 143 ms
11,504 KB
testcase_42 AC 144 ms
11,504 KB
testcase_43 AC 144 ms
11,508 KB
testcase_44 AC 144 ms
11,348 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
template <typename T> using posteriority_queue = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
template <typename T> void unique(vector<T> &a) { a.erase(unique(ALL(a)), a.end()); }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int mod = MOD;
struct ModInt {
  unsigned val;
  ModInt(): val(0) {}
  ModInt(ll x) : val(x >= 0 ? x % mod : x % mod + mod) {}
  ModInt pow(ll exponent) {
    ModInt tmp = *this, res = 1;
    while (exponent > 0) {
      if (exponent & 1) res *= tmp;
      tmp *= tmp;
      exponent >>= 1;
    }
    return res;
  }
  ModInt &operator+=(const ModInt &x) { if((val += x.val) >= mod) val -= mod; return *this; }
  ModInt &operator-=(const ModInt &x) { if((val += mod - x.val) >= mod) val -= mod; return *this; }
  ModInt &operator*=(const ModInt &x) { val = static_cast<unsigned long long>(val) * x.val % mod; return *this; }
  ModInt &operator/=(const ModInt &x) {
    // assert(__gcd(static_cast<int>(x.val), mod) == 1);
    unsigned a = x.val, b = mod; int u = 1, v = 0;
    while (b) {
      unsigned tmp = a / b;
      swap(a -= tmp * b, b);
      swap(u -= tmp * v, v);
    }
    return *this *= u;
  }
  bool operator==(const ModInt &x) const { return val == x.val; }
  bool operator!=(const ModInt &x) const { return val != x.val; }
  bool operator<(const ModInt &x) const { return val < x.val; }
  bool operator<=(const ModInt &x) const { return val <= x.val; }
  bool operator>(const ModInt &x) const { return val > x.val; }
  bool operator>=(const ModInt &x) const { return val >= x.val; }
  ModInt &operator++() { if (++val == mod) val = 0; return *this; }
  ModInt operator++(int) { ModInt res = *this; ++*this; return res; }
  ModInt &operator--() { val = (val == 0 ? mod : val) - 1; return *this; }
  ModInt operator--(int) { ModInt res = *this; --*this; return res; }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { return ModInt(val ? mod - val : 0); }
  ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }
  ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }
  ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }
  ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; }
  friend ostream &operator<<(ostream &os, const ModInt &x) { return os << x.val; }
  friend istream &operator>>(istream &is, ModInt &x) { ll val; is >> val; x = ModInt(val); return is; }
};
ModInt abs(const ModInt &x) { return x; }
struct Combinatorics {
  int val; // "val!" and "mod" must be disjoint.
  vector<ModInt> fact, fact_inv, inv;
  Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {
    fact[0] = 1;
    FOR(i, 1, val + 1) fact[i] = fact[i - 1] * i;
    fact_inv[val] = ModInt(1) / fact[val];
    for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;
    FOR(i, 1, val + 1) inv[i] = fact[i - 1] * fact_inv[i];
  }
  ModInt nCk(int n, int k) {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    // assert(n <= val && k <= val);
    return fact[n] * fact_inv[k] * fact_inv[n - k];
  }
  ModInt nPk(int n, int k) {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    // assert(n <= val);
    return fact[n] * fact_inv[n - k];
  }
  ModInt nHk(int n, int k) {
    if (n < 0 || k < 0) return ModInt(0);
    return (k == 0 ? ModInt(1) : nCk(n + k - 1, k));
  }
};

template <typename Monoid>
struct RSQ {
  RSQ(int sz, const Monoid UNITY = 0) : UNITY(UNITY) {
    init(sz);
    dat.assign((n << 1) - 1, UNITY);
  }

  RSQ(const vector<Monoid> &a, const Monoid UNITY = 0) : UNITY(UNITY) {
    int a_sz = a.size();
    init(a_sz);
    dat.resize((n << 1) - 1);
    REP(i, a_sz) dat[n - 1 + i] = a[i];
    for (int i = n - 2; i >= 0; --i) dat[i] = dat[(i << 1) + 1] + dat[(i << 1) + 2];
  }

  void add(int node, Monoid val) {
    node += n - 1;
    dat[node] += val;
    while (node > 0) {
      node = (node - 1) >> 1;
      dat[node] = dat[(node << 1) + 1] + dat[(node << 1) + 2];
    }
  }

  Monoid sum(int a, int b) { return sum(a, b, 0, 0, n); }

  Monoid operator[](const int idx) const { return dat[idx + n - 1]; }

  int find(int a, int b, Monoid val) { return find(a, b, val, 0, 0, n); }

private:
  int n = 1;
  const Monoid UNITY;
  vector<Monoid> dat;

  void init(int sz) { while (n < sz) n <<= 1; }

  Monoid sum(int a, int b, int node, int left, int right) {
    if (right <= a || b <= left) return UNITY;
    if (a <= left && right <= b) return dat[node];
    return sum(a, b, (node << 1) + 1, left, (left + right) >> 1) + sum(a, b, (node << 1) + 2, (left + right) >> 1, right);
  }

  int find(int a, int b, Monoid val, int node, int left, int right) {
    if (dat[node] < val || right <= a || b <= left) return -1;
    if (right - left == 1) return node - (n - 1);
    int res_l = find(a, b, val, (node << 1) + 1, left, (left + right) >> 1);
    if (res_l != -1) return res_l;
    return find(a, b, val, (node << 1) + 2, (left + right) >> 1, right);
  }
};

template <typename Monoid>
struct RMQ {
  RMQ(int sz, const Monoid UNITY) : UNITY(UNITY) {
    init(sz);
    dat.assign((n << 1) - 1, UNITY);
  }

  RMQ(const vector<Monoid> &a, const Monoid UNITY) : UNITY(UNITY) {
    int a_sz = a.size();
    init(a_sz);
    dat.resize((n << 1) - 1);
    REP(i, a_sz) dat[n - 1 + i] = a[i];
    for (int i = n - 2; i >= 0; --i) dat[i] = max(dat[(i << 1) + 1], dat[(i << 1) + 2]);
  }

  void update(int node, Monoid val) {
    node += n - 1;
    dat[node] = val;
    while (node > 0) {
      node = (node - 1) >> 1;
      dat[node] = max(dat[(node << 1) + 1], dat[(node << 1) + 2]);
    }
  }

  Monoid query(int a, int b) { return query(a, b, 0, 0, n); }

  int find(int a, int b, Monoid val) { return find(a, b, val, 0, 0, n); }

  Monoid operator[](const int idx) const { return dat[idx + n - 1]; }

private:
  int n = 1;
  const Monoid UNITY;
  vector<Monoid> dat;

  void init(int sz) { while (n < sz) n <<= 1; }

  Monoid query(int a, int b, int node, int left, int right) {
    if (right <= a || b <= left) return UNITY;
    if (a <= left && right <= b) return dat[node];
    return max(query(a, b, (node << 1) + 1, left, (left + right) >> 1), query(a, b, (node << 1) + 2, (left + right) >> 1, right));
  }

  int find(int a, int b, Monoid val, int node, int left, int right) {
    if (dat[node] < val || right <= a || b <= left) return -1;
    if (right - left == 1) return node - (n - 1);
    int res_l = find(a, b, val, (node << 1) + 1, left, (left + right) >> 1);
    if (res_l != -1) return res_l;
    return find(a, b, val, (node << 1) + 2, (left + right) >> 1, right);
  }
};

template <typename T>
vector<T> lis(const vector<T> &a, const T TINF) {
  int n = a.size();
  vector<T> check(n, TINF);
  vector<int> idx(n);
  REP(i, n) {
    idx[i] = lower_bound(ALL(check), a[i]) - check.begin();
    check[idx[i]] = a[i];
  }
  int res_sz = lower_bound(ALL(check), TINF) - check.begin();
  vector<T> res(res_sz--);
  for (int i = n - 1; res_sz >= 0 && i >= 0; --i) {
    if (idx[i] == res_sz) res[res_sz--] = a[i];
  }
  return res;
}

int main() {
  int n; cin >> n;
  vector<int> a(n); REP(i, n) cin >> a[i];
  int len = lis(a, INF).size();
  vector<int> idx(n);
  iota(ALL(idx), 0);
  sort(ALL(idx), [&](int l, int r) { return a[l] == a[r] ? r < l : a[l] < a[r]; });
  RMQ<int> rmq(n, -INF);
  REP(i, n) rmq.update(i, 0);
  REP(i, n) {
    int now = idx[i];
    rmq.update(now, max(rmq.query(0, now), 0) + 1);
  }
  // REP(i, n) cout << rmq[i] << ' ';
  // return 0;
  vector<vector<int> > pos(len + 1);
  REP(i, n) pos[rmq[i]].emplace_back(i);
  vector<RSQ<ModInt> > b;
  REP(i, len + 1) b.emplace_back(RSQ<ModInt>(pos[i].size()));
  REP(i, n) {
    int now = idx[i], p = lower_bound(ALL(pos[rmq[now]]), now) - pos[rmq[now]].begin();
    int prev = lower_bound(ALL(pos[rmq[now] - 1]), now) - pos[rmq[now] - 1].begin();
    // cout << now << ' ' << p << ' ' << prev << ' ' << rmq[now] << endl;
    b[rmq[now]].add(p, rmq[now] == 1 ? 1 : b[rmq[now] - 1].sum(0, prev));
  }
  cout << b[len].sum(0, pos[len].size()) << '\n';
  return 0;
}
0