結果

問題 No.992 最長増加部分列の数え上げ
ユーザー TsubaMukkuTsubaMukku
提出日時 2020-02-15 06:59:38
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 142 ms / 2,000 ms
コード長 4,088 bytes
コンパイル時間 1,751 ms
コンパイル使用メモリ 172,596 KB
実行使用メモリ 12,940 KB
最終ジャッジ日時 2024-10-06 13:42:09
合計ジャッジ時間 7,604 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
8,320 KB
testcase_01 AC 3 ms
8,016 KB
testcase_02 AC 3 ms
8,192 KB
testcase_03 AC 5 ms
8,124 KB
testcase_04 AC 54 ms
9,856 KB
testcase_05 AC 40 ms
9,472 KB
testcase_06 AC 66 ms
10,368 KB
testcase_07 AC 47 ms
9,636 KB
testcase_08 AC 27 ms
9,068 KB
testcase_09 AC 50 ms
9,728 KB
testcase_10 AC 65 ms
10,336 KB
testcase_11 AC 82 ms
10,944 KB
testcase_12 AC 20 ms
8,628 KB
testcase_13 AC 47 ms
9,580 KB
testcase_14 AC 47 ms
9,588 KB
testcase_15 AC 21 ms
8,700 KB
testcase_16 AC 123 ms
12,308 KB
testcase_17 AC 27 ms
9,020 KB
testcase_18 AC 46 ms
9,688 KB
testcase_19 AC 81 ms
10,876 KB
testcase_20 AC 137 ms
12,752 KB
testcase_21 AC 134 ms
12,672 KB
testcase_22 AC 135 ms
12,780 KB
testcase_23 AC 137 ms
12,852 KB
testcase_24 AC 138 ms
12,672 KB
testcase_25 AC 137 ms
12,680 KB
testcase_26 AC 136 ms
12,780 KB
testcase_27 AC 142 ms
12,788 KB
testcase_28 AC 142 ms
12,800 KB
testcase_29 AC 135 ms
12,800 KB
testcase_30 AC 120 ms
12,748 KB
testcase_31 AC 123 ms
12,800 KB
testcase_32 AC 122 ms
12,712 KB
testcase_33 AC 121 ms
12,800 KB
testcase_34 AC 120 ms
12,880 KB
testcase_35 AC 129 ms
12,796 KB
testcase_36 AC 129 ms
12,804 KB
testcase_37 AC 129 ms
12,884 KB
testcase_38 AC 129 ms
12,784 KB
testcase_39 AC 128 ms
12,836 KB
testcase_40 AC 116 ms
12,708 KB
testcase_41 AC 115 ms
12,940 KB
testcase_42 AC 118 ms
12,732 KB
testcase_43 AC 118 ms
12,736 KB
testcase_44 AC 116 ms
12,792 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountll((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzll(x))
#define rep(i, n) for(int i = 0; i < n; i++)
const int inf9 = 1e9; const lint inf18 = 1e18;
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ double y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); } double euclidean(double first, double second){ return sqrt(first * first + second * second); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint P(int n, int r){ if(r < 0 || n < r) return 0; return (fact[n] * inv[n - r] % mod); } lint C(int p, int q){ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }
template<class itr, class itr2> bool next_sequence2(itr first, itr last, itr2 first2, itr2 last2){ itr now = last; itr2 now2 = last2; while(now != first){ now--, now2--; (*now)++; if((*now) == (*now2)){ (*now) = 0; }else{ return true; } } return false; }
inline int at(lint i, int j){ return (i >> j) & 1; }

struct pattern{
    int weight;
    lint num;
};

pattern max(pattern a, pattern b){
    if(a.weight < b.weight){
        return b;
    }else if(a.weight > b.weight){
        return a;
    }else{
        a.num = (a.num + b.num) % mod;
        return a;
    }
}

int sz = (1 << 18);
pattern arr[300000];

void update(int pos, pattern x){ // 1-indexed
    for(int i = pos; i <= sz; i += (i & -i)){
        arr[i] = max(arr[i], x);
    }
}

pattern query(int right){ // 1-indexed, [1, right]
    pattern ans = {0, 0};
    for(int i = right; i > 0; i -= (i & -i)){
        ans = max(ans, arr[i]);
    }
    return ans;
}

int main(){
    int N;
    cin >> N;
    lint A[N];
    cins(A, A + N);
    pair<lint, int> A_sorted[N + 1];
    for(int i = 0; i < N; i++){
        A_sorted[i] = {A[i], -i};
    }
    sort(A_sorted, A_sorted + N);
    memset(arr, 0, sizeof(arr));
    update(1, {0, 1});
    for(int i = 0; i < N; i++){
        int pos = -A_sorted[i].second;
        pattern previous = query(pos + 1);
        previous.weight++;
        update(pos + 2, previous);
    }
    cout << query(N + 2).num << endl;
}
0