#900661 (C++17) No.711 競技レーティング単調増加

• 問題: No.711 競技レーティング単調増加
• ユーザー: satashun
• 提出日時: 2023-08-11 22:13:35
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 78 ms / 2,000 ms
• コード長: 10,112 bytes
• コンパイル時間: 2,193 ms
• コンパイル使用メモリ: 212,588 KB
• 実行使用メモリ: 6,940 KB
• 最終ジャッジ日時: 2024-04-29 13:12:29
• 合計ジャッジ時間: 5,778 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	1 ms; 6,940 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	1 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	54 ms; 6,656 KB
testcase_19	AC	52 ms; 6,784 KB
testcase_20	AC	56 ms; 6,656 KB
testcase_21	AC	57 ms; 6,912 KB
testcase_22	AC	54 ms; 6,656 KB
testcase_23	AC	63 ms; 6,784 KB
testcase_24	AC	61 ms; 6,784 KB
testcase_25	AC	51 ms; 6,528 KB
testcase_26	AC	57 ms; 6,656 KB
testcase_27	AC	51 ms; 6,528 KB
testcase_28	AC	30 ms; 5,632 KB
testcase_29	AC	34 ms; 5,888 KB
testcase_30	AC	61 ms; 5,376 KB
testcase_31	AC	74 ms; 5,632 KB
testcase_32	AC	78 ms; 5,504 KB
testcase_33	AC	44 ms; 5,376 KB
testcase_34	AC	40 ms; 5,376 KB
testcase_35	AC	47 ms; 5,632 KB
testcase_36	AC	18 ms; 6,656 KB
testcase_37	AC	57 ms; 6,912 KB
testcase_38	AC	48 ms; 6,656 KB
testcase_39	AC	19 ms; 5,376 KB
testcase_40	AC	22 ms; 5,376 KB
testcase_41	AC	1 ms; 5,376 KB
testcase_42	AC	12 ms; 5,376 KB
testcase_43	AC	38 ms; 6,272 KB

ソースコード

#pragma region satashun
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

template <class T>
V<T> make_vec(size_t a) {
    return V<T>(a);
}

template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

template <typename T, typename V>
void fill_vec(T& v, const V& val) {
    v = val;
}

template <typename T, typename V>
void fill_vec(vector<T>& vec, const V& val) {
    for (auto& v : vec) fill_vec(v, val);
}

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <typename T>
int arglb(const V<T>& v, const T& x) {
    return distance(v.begin(), lower_bound(ALL(v), x));
}

template <typename T>
int argub(const V<T>& v, const T& x) {
    return distance(v.begin(), upper_bound(ALL(v), x));
}

template <class T>
void mkuni(vector<T>& v) {
    sort(ALL(v));
    v.erase(unique(ALL(v)), end(v));
}

template <class T>
vector<int> sort_by(const vector<T>& v, bool increasing = true) {
    vector<int> res(v.size());
    iota(res.begin(), res.end(), 0);

    if (increasing) {
        stable_sort(res.begin(), res.end(),
                    [&](int i, int j) { return v[i] < v[j]; });
    } else {
        stable_sort(res.begin(), res.end(),
                    [&](int i, int j) { return v[i] > v[j]; });
    }
    return res;
}

// prototype
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p);

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v);

template <class T>
istream& operator>>(istream& is, vector<T>& v);

template <class T, size_t sz>
ostream& operator<<(ostream& os, const array<T, sz>& arr);

template <class T>
ostream& operator<<(ostream& os, const set<T>& ST);

template <class T>
ostream& operator<<(ostream& os, const multiset<T>& ST);

template <class T, class U>
ostream& operator<<(ostream& os, const map<T, U>& MP);

ostream& operator<<(ostream& o, __int128_t x);

// io functions
template <class T, class U>
istream& operator>>(istream& is, pair<T, U>& p) {
    is >> p.first >> p.second;
    return is;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) {
        is >> x;
    }
    return is;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

template <class T, size_t sz>
ostream& operator<<(ostream& os, const array<T, sz>& arr) {
    os << '[';
    for (auto v : arr) os << v << ',';
    os << ']';
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const set<T>& ST) {
    os << "{";
    for (auto it = ST.begin(); it != ST.end(); ++it) {
        if (it != ST.begin()) os << ",";
        os << *it;
    }
    os << "}";
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const multiset<T>& ST) {
    os << "{";
    for (auto it = ST.begin(); it != ST.end(); ++it) {
        if (it != ST.begin()) os << ",";
        os << *it;
    }
    os << "}";
    return os;
}

template <class T, class U>
ostream& operator<<(ostream& os, const map<T, U>& MP) {
    for (auto it = MP.begin(); it != MP.end(); ++it) {
        os << "(" << it->first << ": " << it->second << ")";
    }
    return os;
}

string to_string(__int128_t x) {
    if (x == 0) return "0";
    string result;
    if (x < 0) {
        result += "-";
        x *= -1;
    }
    string t;
    while (x) {
        t.push_back('0' + x % 10);
        x /= 10;
    }
    reverse(t.begin(), t.end());
    return result + t;
}

ostream& operator<<(ostream& o, __int128_t x) { return o << to_string(x); }

#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

template <class T>
V<T>& operator+=(V<T>& vec, const T& v) {
    for (auto& x : vec) x += v;
    return vec;
}

template <class T>
V<T>& operator-=(V<T>& vec, const T& v) {
    for (auto& x : vec) x -= v;
    return vec;
}

// suc : 1 = newline, 2 = space
template <class T>
void print(T x, int suc = 1) {
    cout << x;
    if (suc == 1)
        cout << "\n";
    else if (suc == 2)
        cout << " ";
}

template <class T>
void print(const vector<T>& v, int suc = 1) {
    for (int i = 0; i < v.size(); ++i)
        print(v[i], i == int(v.size()) - 1 ? suc : 2);
}

template <class T>
void show(T x) {
    print(x, 1);
}

template <typename Head, typename... Tail>
void show(Head H, Tail... T) {
    print(H, 2);
    show(T...);
}

int topbit(int t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(int a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(int t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
int bit_parity(int t) { return __builtin_parity(t); }
int bit_parity(ll t) { return __builtin_parityll(t); }

struct prepare_io {
    prepare_io() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    }
} prep_io;
#pragma endregion satashun

// index of root = 1
template <class U>
struct segtree {
    using T = typename U::T;
    int sz;
    V<T> dat;

    segtree() {}
    segtree(int n) : _n(n) {
        sz = 1;
        while (sz < n) sz <<= 1;
        dat.assign(sz * 2, U::id());
    }

    segtree(const V<T>& a) {
        int n = a.size();
        _n = n;
        sz = 1;
        while (sz < n) sz <<= 1;
        dat.assign(sz * 2, U::id());
        for (int i = 0; i < n; ++i) {
            dat[sz + i] = a[i];
        }
        for (int i = sz - 1; i >= 1; --i) {
            upd(i);
        }
    }

    void upd(int p) { dat[p] = U::op(dat[p << 1], dat[p << 1 | 1]); }

    void build() {
        for (int i = sz - 1; i > 0; --i) {
            dat[i] = U::op(dat[i << 1], dat[i << 1 | 1]);
        }
    }

    void modify(int p, T v) {
        p += sz;
        dat[p] = v;
        while (p >>= 1) {
            dat[p] = U::op(dat[p << 1], dat[p << 1 | 1]);
        }
    }

    T get(int p) const { return dat[p + sz]; }

    //[l, r)
    T query(int l, int r) const {
        T lval = U::id(), rval = U::id();
        for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) {
            if (l & 1) lval = U::op(lval, dat[l++]);
            if (r & 1) rval = U::op(dat[--r], rval);
        }
        return U::op(lval, rval);
    }

    // ABC194E
    // https://atcoder.jp/contests/practice2/submissions/33977727
    // https://github.com/atcoder/ac-library/blob/master/atcoder/segtree.hpp
    // find max r s.t. f([l, r)) = true
    template <class F>
    int max_right(int l, F f) const {
        // assert(0 <= l && l <= _n);
        // assert(f(U::id()));

        if (l == sz) return sz;
        l += sz;
        auto cur = U::id();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(U::op(cur, dat[l]))) {
                while (l < sz) {
                    l = l * 2;
                    if (f(U::op(cur, dat[l]))) {
                        cur = U::op(cur, dat[l]);
                        l++;
                    }
                }
                return l - sz;
            }
            cur = U::op(cur, dat[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    // needs verification
    // find min l s.t. f([l, r)) = true
    template <class F>
    int min_left(int r, F f) const {
        // assert(0 <= r && r <= _n);
        // assert(f(U::id()));

        if (r == 0) return 0;
        r += sz;
        auto cur = U::id();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(U::op(dat[r], cur))) {
                while (r < sz) {
                    r = (2 * r + 1);
                    if (f(U::op(dat[r], cur))) {
                        cur = U::op(dat[r], cur);
                        r--;
                    }
                }
                return r + 1 - sz;
            }
            cur = U::op(dat[r], cur);
        } while ((r & -r) != r);
        return 0;
    }

   private:
    int _n;
};

constexpr int INF = -1;

// modify only U
struct U {
    using T = int;
    static T id() { return INF; }
    static T op(const T& a, const T& b) { return max(a, b); }
};

void slv() {
    // input
    int N;
    cin >> N;
    V<int> A(N);
    cin >> A;
    // solve

    rep(i, N) A[i] -= i;

    auto as = A;
    mkuni(as);

    int sz = SZ(as);
    segtree<U> seg(sz);

    int mx = 0;

    rep(i, N) {
        if (A[i] > 0) {
            int p = arglb(as, A[i]);
            int v = max(1, seg.query(0, p + 1) + 1);

            chmax(mx, v);
            seg.modify(p, v);
        }
    }
    show(N - mx);
}

int main() {
    int cases = 1;
    // cin >> cases;
    rep(i, cases) slv();

    return 0;
}