結果

問題 No.992 最長増加部分列の数え上げ
ユーザー knshnbknshnb
提出日時 2020-02-14 23:30:18
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,823 bytes
コンパイル時間 2,636 ms
コンパイル使用メモリ 210,992 KB
実行使用メモリ 16,256 KB
最終ジャッジ日時 2024-04-16 02:59:20
合計ジャッジ時間 5,943 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 WA -
testcase_04 AC 24 ms
8,064 KB
testcase_05 AC 19 ms
6,912 KB
testcase_06 AC 30 ms
8,960 KB
testcase_07 AC 23 ms
7,680 KB
testcase_08 AC 13 ms
5,760 KB
testcase_09 AC 24 ms
7,680 KB
testcase_10 AC 30 ms
8,960 KB
testcase_11 AC 37 ms
10,624 KB
testcase_12 AC 9 ms
5,376 KB
testcase_13 AC 21 ms
7,424 KB
testcase_14 AC 22 ms
7,424 KB
testcase_15 AC 9 ms
5,376 KB
testcase_16 AC 57 ms
15,104 KB
testcase_17 AC 13 ms
5,760 KB
testcase_18 AC 21 ms
7,296 KB
testcase_19 AC 37 ms
10,496 KB
testcase_20 AC 61 ms
16,128 KB
testcase_21 AC 62 ms
16,000 KB
testcase_22 AC 61 ms
16,256 KB
testcase_23 AC 61 ms
16,128 KB
testcase_24 AC 61 ms
16,000 KB
testcase_25 AC 61 ms
16,000 KB
testcase_26 AC 63 ms
16,128 KB
testcase_27 AC 62 ms
16,000 KB
testcase_28 AC 62 ms
16,000 KB
testcase_29 AC 61 ms
16,000 KB
testcase_30 AC 47 ms
14,320 KB
testcase_31 AC 47 ms
14,412 KB
testcase_32 AC 47 ms
14,420 KB
testcase_33 AC 47 ms
14,268 KB
testcase_34 AC 47 ms
14,320 KB
testcase_35 AC 44 ms
15,720 KB
testcase_36 AC 44 ms
15,596 KB
testcase_37 AC 45 ms
15,592 KB
testcase_38 AC 46 ms
15,724 KB
testcase_39 AC 45 ms
15,592 KB
testcase_40 AC 48 ms
15,200 KB
testcase_41 AC 48 ms
15,336 KB
testcase_42 AC 50 ms
15,212 KB
testcase_43 AC 50 ms
15,216 KB
testcase_44 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>  // clang-format off
using namespace std;
using Int = long long;
#define REP2(i, n) for (Int i = 0, max_i = (n); i < max_i; i++)
#define REP3(i, a, b) for (Int i = (a), max_i = (b); i < max_i; i++)
#define OVERLOAD2(_1, _2, _3, name, ...) name
#define REP(...) OVERLOAD2(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
struct SetupIO { SetupIO() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(13); } } setup_io;
#ifndef _MY_DEBUG
#define dump(...)
#endif  // clang-format on

/**
 *    author:  knshnb
 *    created: Fri Feb 14 23:02:23 JST 2020
 **/

template <class T> T pow(T x, int n, const T UNION = 1) {
    T ret = UNION;
    while (n) {
        if (n & 1) ret *= x;
        x *= x;
        n >>= 1;
    }
    return ret;
}

template <int MD> struct ModInt {
    int x;
    static unordered_map<int, int> to_inv;
    ModInt() : x(0) {}
    ModInt(long long x_) {
        if ((x = x_ % MD + MD) >= MD) x -= MD;
    }

    ModInt& operator+=(ModInt that) {
        if ((x += that.x) >= MD) x -= MD;
        return *this;
    }
    ModInt& operator*=(ModInt that) {
        x = (unsigned long long)x * that.x % MD;
        return *this;
    }
    ModInt& operator-=(ModInt that) {
        if ((x -= that.x) < 0) x += MD;
        return *this;
    }
    ModInt& operator/=(ModInt that) {
        x = (unsigned long long)x * that.inv().x % MD;
        return *this;
    }
    ModInt operator-() const { return -x < 0 ? MD - x : -x; }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    bool operator<(ModInt that) const { return true; }
    ModInt inv() const { return to_inv.count(this->x) ? to_inv[this->x] : (to_inv[this->x] = pow(*this, MD - 2).x); }

    friend ostream& operator<<(ostream& s, ModInt<MD> a) {
        s << a.x;
        return s;
    }
    friend istream& operator>>(istream& s, ModInt<MD>& a) {
        long long tmp;
        s >> tmp;
        a = ModInt<MD>(tmp);
        return s;
    }
    friend string to_string(ModInt<MD> a) { return to_string(a.x); }
};
template <int MD> unordered_map<int, int> ModInt<MD>::to_inv;
using mint = ModInt<1000000007>;

vector<mint> fact, fact_inv;
void init_factorial(int n) {
    fact = vector<mint>(n + 1, 1);
    fact_inv = vector<mint>(n + 1);
    for (int i = 0; i < n; i++) fact[i + 1] = fact[i] * (i + 1);
    fact_inv[n] = mint(1) / fact[n];
    for (int i = n - 1; i >= 0; i--) fact_inv[i] = fact_inv[i + 1] * (i + 1);
    // for (int i = 0; i < n + 1; i++) assert(fact[i] * fact_inv[i] == 1);
}
mint comb(int n, int r) { return fact[n] * fact_inv[r] * fact_inv[n - r]; }

using pii = pair<Int, mint>;
signed main() {
    Int n;
    cin >> n;
    vector<Int> a(n);
    REP(i, n) cin >> a[i];
    vector<Int> dp(n, 1e18);
    vector<vector<pii>> g(n);
    for (Int x : a) {
        Int j = lower_bound(dp.begin(), dp.end(), x) - dp.begin();
        dp[j] = x;
        mint cnt = 0;
        if (j > 0) {
            auto it = upper_bound(g[j - 1].begin(), g[j - 1].end(), pii(-x, 1e10));
            mint minus = it == g[j - 1].begin() ? 0 : prev(it)->second;
            mint plus = g[j - 1].empty() ? 0 : g[j - 1].back().second;
            cnt += plus - minus;
        } else {
            cnt = 1;
        }
        mint prv = g[j].empty() ? 0 : g[j].back().second;
        g[j].push_back({-x, cnt + prv});
    }
    Int idx = lower_bound(dp.begin(), dp.end(), 1e18) - dp.begin();
    cout << g[idx - 1].back().second << endl;
}
0