結果

問題 No.1188 レベルX門松列
ユーザー uchiiiiuchiiii
提出日時 2020-09-01 17:26:57
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 42 ms / 2,000 ms
コード長 4,259 bytes
コンパイル時間 3,439 ms
コンパイル使用メモリ 220,872 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-04-30 01:33:26
合計ジャッジ時間 5,232 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 20 ms
5,248 KB
testcase_01 AC 34 ms
5,376 KB
testcase_02 AC 31 ms
5,376 KB
testcase_03 AC 40 ms
5,376 KB
testcase_04 AC 32 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 17 ms
5,376 KB
testcase_07 AC 32 ms
5,376 KB
testcase_08 AC 32 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 5 ms
5,376 KB
testcase_12 AC 5 ms
5,376 KB
testcase_13 AC 5 ms
5,376 KB
testcase_14 AC 26 ms
5,376 KB
testcase_15 AC 42 ms
5,376 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 33 ms
5,376 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 31 ms
5,376 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 #

#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1};
constexpr int INF=1<<30;
constexpr ll LINF=1LL<<60; 
constexpr ll mod=1e9+7;
template<class T>vector<T> vec(int len, T elem) { return vector<T>(len, elem); } // auto dp = vec(52, vec(103, vec(103, INF)));
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
template<class T>inline int popcount(T a) {return __builtin_popcount(a);}
template<class T>inline T emod(T a, T p) { return (a%p + p) % p;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {os << '\n'; for (auto v : vec) os << v << ' '; os << '\n'; return os;}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
struct MyIO {
    MyIO(){
        cin.tie(0); 
        ios::sync_with_stdio(false); 
        cout << fixed << setprecision(15);
    }
} IO_OI;
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
//-------------------
int main() {
    int n; cin>>n;
    vector<int> a(n);
    int ans = 0;
    rep(i,n) {
        cin>>a[i];
    }
    {
        vector<int> b(n);
        vector<int> c(n+2,INF); c[0] = -INF;
        rep(i,n) {
            int k = lower_bound(ALL(c), a[i]) - c.begin();
            b[i] = k;
            chmin(c[k], a[i]);
        }
        debug(b,c);
        vector<int> d(n+2,INF); d[0] = -INF; 
        for(int i=n-1;i>=0;i--) {
            int k = lower_bound(ALL(d), a[i]) - d.begin();
            chmax(ans, min(b[i]-1, k-1));
            chmin(d[k], a[i]);
        }
        debug(d);
    }
    rep(i, n) a[i] = -a[i];
    {
        vector<int> b(n);
        vector<int> c(n+2,INF); c[0] = -INF; 
        rep(i,n) {
            int k = lower_bound(ALL(c), a[i]) - c.begin();
            b[i] = k;
            chmin(c[k], a[i]);
        }
        vector<int> d(n+2,INF); d[0] = -INF; 
        for(int i=n-1;i>=0;i--) {
            int k = lower_bound(ALL(d), a[i]) - d.begin();
            chmax(ans, min(b[i]-1, k-1));
            chmin(d[k], a[i]);
        }

    }

    cout << ans << endl;
    return 0;
}
0