結果

問題 No.1188 レベルX門松列
ユーザー stoqstoq
提出日時 2020-12-10 03:35:10
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 150 ms / 2,000 ms
コード長 5,052 bytes
コンパイル時間 2,301 ms
コンパイル使用メモリ 221,436 KB
実行使用メモリ 11,064 KB
最終ジャッジ日時 2024-09-19 10:41:20
合計ジャッジ時間 4,907 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
6,528 KB
testcase_01 AC 106 ms
8,712 KB
testcase_02 AC 95 ms
8,320 KB
testcase_03 AC 129 ms
9,312 KB
testcase_04 AC 117 ms
11,064 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 51 ms
6,400 KB
testcase_07 AC 100 ms
8,720 KB
testcase_08 AC 97 ms
8,720 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 10 ms
5,376 KB
testcase_12 AC 10 ms
5,376 KB
testcase_13 AC 12 ms
5,376 KB
testcase_14 AC 80 ms
7,700 KB
testcase_15 AC 150 ms
11,016 KB
testcase_16 AC 3 ms
5,376 KB
testcase_17 AC 115 ms
9,728 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 105 ms
9,472 KB
testcase_20 AC 2 ms
5,376 KB
testcase_21 AC 2 ms
5,376 KB
testcase_22 AC 2 ms
5,376 KB
testcase_23 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 2

#pragma region Macros

#include <bits/stdc++.h>
using namespace std;

#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-7;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

struct io_init
{
  io_init()
  {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

template <typename T>
struct SegmentTree
{
  using Fn = function<T(T, T)>;
  int N;
  vector<T> dat;
  T ti;
  Fn f;

  SegmentTree() {}
  SegmentTree(int n, Fn f, T ti) : f(f), ti(ti)
  {
    N = 1;
    while (N < n)
      N *= 2;
    dat.assign(2 * N - 1, ti);
  }
  SegmentTree(const vector<T> &v, Fn f, T ti) : f(f), ti(ti)
  {
    N = 1;
    int sz = v.size();
    while (N < sz)
      N *= 2;
    dat.resize(2 * N - 1);
    for (int i = 0; i < N; ++i)
      dat[i + N - 1] = (i < sz ? v[i] : ti);
    for (int i = N - 2; i >= 0; --i)
      dat[i] = f(dat[i * 2 + 1], dat[i * 2 + 2]);
  }

  void update(int k, T a)
  {
    k += N - 1;
    dat[k] = a;
    while (k > 0)
    {
      k = (k - 1) / 2;
      dat[k] = f(dat[k * 2 + 1], dat[k * 2 + 2]);
    }
  }

  T get(int k) { return dat[k + N - 1]; }

  void add(int k, T a) { update(k, f(get(k), a)); }

  T query(int l, int r)
  {
    T vl = ti, vr = ti;
    for (l += (N - 1), r += (N - 1); l < r; l >>= 1, r >>= 1)
    {
      if ((l & 1) == 0)
        vl = f(vl, dat[l]);
      if ((r & 1) == 0)
        vr = f(vr, dat[--r]);
    }
    return f(vl, vr);
  }
  T query_all() { return dat[0]; }

  void display()
  {
    for (int i = 0; i < N; i++)
      cerr << get(i) << " ";
    cerr << "\n";
  }
};

void solve()
{
  int n;
  cin >> n;
  vector<int> a(n);
  rep(i, n) cin >> a[i];
  map<int, int> mp;
  for (auto ai : a)
    mp[ai] = 0;
  int z = 0;
  for (auto &&[k, v] : mp)
    v = z++;
  for (auto &&ai : a)
    ai = mp[ai];

  int ans = 0;
  {
    vector<int> inc(n), dec(n);
    auto f = [](int a, int b) { return max(a, b); };

    SegmentTree<int> sg1(n, f, 0);
    rep(i, n)
    {
      int t = sg1.query(0, a[i]);
      assert(sg1.get(a[i]) <= t + 1);
      sg1.update(a[i], t + 1);
      inc[i] = t;
    }
    SegmentTree<int> sg2(n, f, 0);
    for (int i = n - 1; i >= 0; i--)
    {
      int t = sg2.query(0, a[i]);
      assert(sg2.get(a[i]) <= t + 1);
      sg2.update(a[i], t + 1);
      dec[i] = t;
    }
    rep(i, n) chmax(ans, min(inc[i], dec[i]));
  }

  {
    vector<int> inc(n), dec(n);
    auto f = [](int a, int b) { return max(a, b); };

    SegmentTree<int> sg1(n, f, 0);
    rep(i, n)
    {
      int t = sg1.query(a[i] + 1, n);
      assert(sg1.get(a[i]) <= t + 1);
      sg1.update(a[i], t + 1);
      inc[i] = t;
    }
    SegmentTree<int> sg2(n, f, 0);
    for (int i = n - 1; i >= 0; i--)
    {
      int t = sg2.query(a[i] + 1, n);
      assert(sg2.get(a[i]) <= t + 1);
      sg2.update(a[i], t + 1);
      dec[i] = t;
    }
    rep(i, n) chmax(ans, min(inc[i], dec[i]));
  }

  cout << ans << "\n";
}

int main()
{
  solve();
}
0