제출 #1296519

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1296519		trandaihao5555	Rabbit Carrot (LMIO19_triusis)	C++20	100 / 100	92 ms	11652 KiB

triusis

#include <bits/stdc++.h>

#define int long long

#define debug     cout << "ok\n";
#define SQR(x)    (1LL * ((x) * (x)))
#define MASK(i)   (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define fi        first
#define se        second
#define pb        push_back

#define mp make_pair
#define pii pair<int,int>
#define pli pair<ll,int>
#define vi vector<int>

#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int ui;

using namespace std;

const int M = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFLL = (ll)2e18 + 7LL;
const ld PI = acos(-1);

const int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
const int dy[] = {0, 0, 1, -1, -1, -1, 1, 1};

template<class _, class __>
    bool minimize(_ &x, const __ y){
        if(x > y){
            x = y;
            return true;
        } else return false;
    }
template<class _, class __>
    bool maximize(_ &x, const __ y){
        if(x < y){
            x = y;
            return true;
        } else return false;
    }

template<class _,class __>
    void Add(_ &x, const __ y) {
        x += y;
        if (x >= M) {
            x -= M;
        }
        return;
    }

template<class _,class __>
    void Diff(_ &x, const __ y) {
        x -= y;
        if (x < 0) {
            x += M;
        }
        return;
    }

//--------------------------------------------------------------

const int MaxN = 2e5+7;

int n,a[MaxN],m;
vi nen;

struct SegmentTree {
    vi val;
    vi Tr;
    int n;

    void Set(vi & a) {
        val.pb(-INFLL);
        n = a.size();
        for (int x : a) val.pb(x);
        Tr.resize(n * 4 + 7, INF);
    }

    int GV(int id,int l,int r,int v) {
        if (val[r] < v) return INF;
        if (val[l] >= v) return Tr[id];
        if (l == r) return INF;
        int m = (l+r) >> 1;
        return min(GV(id<<1,l,m,v),GV(id<<1|1,m+1,r,v));
    }

    int Get(int v) {
        return GV(1,1,n,v);
    }

    void UT(int id,int l,int r,int u,int v) {
        if (val[l] > u || val[r] < u) return;
        if (l == r) {
            minimize(Tr[id],v);
            return;
        }
        int m = (l+r) >> 1;
        UT(id<<1,l,m,u,v);
        UT(id<<1|1,m+1,r,u,v);
        Tr[id] = min(Tr[id<<1],Tr[id<<1|1]);
        return;
    }

    void Upd(int u,int v) {
        UT(1,1,n,u,v);
    }
} Seg;

void sol() {
    cin >> n >> m;
    for (int i=1;i<=n;i++) {
        cin >> a[i];
    }
    for (int i=0;i<=n;i++) {
        a[i] += (n - i) * m;
        nen.pb(a[i]);
    }
    sort(nen.begin(),nen.end());
    nen.erase(unique(nen.begin(),nen.end()),nen.end());
    Seg.Set(nen);
    Seg.Upd(a[0],0);
    int res = n;
    for (int i=1;i<=n;i++) {
        int tmp = Seg.Get(a[i]) + i - 1;
        minimize(res,tmp + n - i);
        Seg.Upd(a[i],tmp - i);
    }
    cout << res;
}

signed main() {
//    freopen("test.inp","r",stdin);
//    freopen("test.out","w",stdout);
    FAST
    int t=1;
//    cin >> t;
    while (t--) sol();
}

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 28 / 28
• Subtask 4: 37 / 37