結果

問題 No.992 最長増加部分列の数え上げ
ユーザー NyaanNyaanNyaanNyaan
提出日時 2020-02-14 22:27:14
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 133 ms / 2,000 ms
コード長 7,243 bytes
コンパイル時間 2,319 ms
コンパイル使用メモリ 178,480 KB
実行使用メモリ 20,480 KB
最終ジャッジ日時 2024-04-16 02:38:15
合計ジャッジ時間 7,329 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 49 ms
9,984 KB
testcase_05 AC 35 ms
8,192 KB
testcase_06 AC 59 ms
11,392 KB
testcase_07 AC 43 ms
9,344 KB
testcase_08 AC 23 ms
6,400 KB
testcase_09 AC 46 ms
9,728 KB
testcase_10 AC 59 ms
11,264 KB
testcase_11 AC 75 ms
13,184 KB
testcase_12 AC 16 ms
5,376 KB
testcase_13 AC 41 ms
9,216 KB
testcase_14 AC 41 ms
9,344 KB
testcase_15 AC 16 ms
5,376 KB
testcase_16 AC 116 ms
18,944 KB
testcase_17 AC 23 ms
6,528 KB
testcase_18 AC 41 ms
9,216 KB
testcase_19 AC 74 ms
13,056 KB
testcase_20 AC 128 ms
20,352 KB
testcase_21 AC 127 ms
20,224 KB
testcase_22 AC 128 ms
20,352 KB
testcase_23 AC 129 ms
20,352 KB
testcase_24 AC 128 ms
20,224 KB
testcase_25 AC 128 ms
20,352 KB
testcase_26 AC 128 ms
20,352 KB
testcase_27 AC 128 ms
20,224 KB
testcase_28 AC 128 ms
20,224 KB
testcase_29 AC 133 ms
20,480 KB
testcase_30 AC 98 ms
19,400 KB
testcase_31 AC 99 ms
19,400 KB
testcase_32 AC 98 ms
19,396 KB
testcase_33 AC 97 ms
19,396 KB
testcase_34 AC 96 ms
19,524 KB
testcase_35 AC 100 ms
20,028 KB
testcase_36 AC 101 ms
19,904 KB
testcase_37 AC 101 ms
19,904 KB
testcase_38 AC 101 ms
20,032 KB
testcase_39 AC 101 ms
20,144 KB
testcase_40 AC 98 ms
19,284 KB
testcase_41 AC 99 ms
19,412 KB
testcase_42 AC 100 ms
19,408 KB
testcase_43 AC 99 ms
19,284 KB
testcase_44 AC 100 ms
19,408 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i,N) for(long long i = 0; i < (long long)(N); i++)
#define repr(i,N) for(long long i = (long long)(N) - 1; i >= 0; i--)
#define rep1(i,N) for(long long i = 1; i <= (long long)(N) ; i++)
#define repr1(i,N) for(long long i = (N) ; (long long)(i) > 0 ; i--)
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
using namespace std; void solve();
using ll = long long; template<class T = ll> using V = vector<T>;
using vi = V<int>; using vl = V<>; using vvi = V< V<int> >;
constexpr int inf = 1001001001; constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#ifdef NyaanDebug
  #include "NyaanDebug.h"
  #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
  #define trca(v,N) do { cerr << #v << " = "; array_out(v , N);cout << endl;} while(0)
#else
  #define trc(...)
  #define trca(...)
  int main(){solve();}
#endif
 
#define inc(...) char __VA_ARGS__; in(__VA_ARGS__)
#define in2(N,s,t) rep(i,N){in(s[i] , t[i]);}
#define in3(N,s,t,u) rep(i,N){in(s[i] , t[i] , u[i]);}
using vd = V<double>; using vs = V<string>; using vvl = V< V<> >;
template<typename T>using heap = priority_queue< T , V<T> , greater<T> >;
 
//using P = pair<ll,char>; using vp = V<P>;
constexpr int MOD = /**/ 1000000007; //*/ 998244353;
//////////////////

template<class T>
struct compress{
  vector<T> xs;
  compress(const vector<T>& v){
    xs.reserve(v.size());
    for(T x : v) xs.push_back(x);
    sort(xs.begin(),xs.end());
    xs.erase(unique(xs.begin(),xs.end()) , xs.end());
  }

  int get(const T& x){
    return lower_bound(xs.begin(),xs.end(),x) - xs.begin();
  }
  int size(){
    return xs.size();
  }
  T& operator[](int i){
    return xs[i];
  }
};

// セグ木
template<typename T,typename F>
struct ST{

  int size;
  vector<T> seg;
  const F func;
  const T UNIT;
  
  ST(int N,F func , T UNIT): func(func) , UNIT(UNIT) {
    size = 1;
    while(size < N) size <<= 1;
    seg.assign(2 * size, UNIT);
  }

  ST(const vector<T> &v,F func , T UNIT) : func(func) , UNIT(UNIT){
    // initialize
    int N = (int)v.size();
    size = 1;
    while(size < N) size <<= 1;
    seg.assign(2 * size , UNIT);
    // set
    for(int i = 0; i < N; i++){
      seg[i + size] = v[i];
    }
    build();
  }

  void set(int k, T x){
    seg[k + size] = x;
  }

  void build(){
    for(int k = size-1; k > 0; k--){
      seg[k] = func(seg[2 * k] , seg[2 * k + 1] );
    }
  }
  
  void update(int k, T x){
    k += size; seg[k] = x;
    while(k >>= 1){
      seg[k] = func( seg[2 * k] , seg[2 * k + 1] );
    }
  }

  void add(int k , T x){
    k += size; seg[k] += x;
    while(k >>= 1){
      seg[k] = func(seg[2 * k] , seg[2 * k + 1] );
    }
  }
  
  // 半開区間[a,b)へのクエリ
  T query(int a, int b){
    T L = UNIT, R = UNIT;
    for(a+=size,b+=size; a<b; a>>=1,b>>=1){
      if(a & 1) L = func(L,seg[a++]);
      if(b & 1) R = func(seg[--b],R);
    }
    return func(L, R);
  }

  T operator[](const int &k) const{
    return seg[k + size];
  }

};

template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  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 x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, 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(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};

using modint = ModInt< MOD >;
using vm = vector<modint>;

void solve(){
  ini(N);
  vi a(N); in(a);
  compress<int> zip(a);
  rep(i , N) a[i] = zip.get(a[i]);

  auto fm = [&](int a,int b){return max(a,b);};
  ST<int,decltype(fm)> seg(zip.size() + 1 , fm , 0);

  using P = pair<int,modint>;
  vector<vector<P>> dp(N + 1);
  each(x , dp) x.emplace_back(inf , 0);

  rep(i , N){
    int cur = seg.query(0 , a[i]);
    seg.update(a[i] , cur + 1);

    modint nxt;
    if(cur == 0) { 
      nxt = 1;
    }else{
      nxt = dp[cur].back().second;
      // にぶたん
      int ng = 0 , ok = sz(dp[cur]) - 1;
      while(ng + 1 < ok){
        int med = (ng + ok) / 2;
        if(dp[cur][med].first < a[i]) ok = med;
        else ng = med;
      }
      // idx = okより右側がok
      // -> 一番後ろの累積からngの累積を引いたもの
      nxt -= dp[cur][ng].second;
    }
    
    // pb
    if(dp[cur + 1].back().first == a[i])
      dp[cur + 1].back().second += nxt;
    else{
      nxt += dp[cur + 1].back().second;
      dp[cur + 1].emplace_back(a[i] , nxt);
    }
  }

  out(dp[seg.query(0 , zip.size())].back().second);
  

}
0