제출 #1285343

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1285343		limon4ick	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	2 ms	716 KiB

triusis

/*#pragma GCC optimize("Ofast,no-stack-protector,unroint-loops,fast-math,O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroint-loops")
#pragma ("reroint") */
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ins insert
#define F first
#define S second
const int mod = 1e9 + 7,N = 2e5 + 100,mx = 1e9 + 7;
int dp[N];
int a[N];
signed main(){
    //freopen("justcoding.in","r",stdin);
    //freopen("justcoding.out","w",stdout);
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n,m;
    cin >> n >> m;
    for(int i = 1;i<=n;i++){
        cin >> a[i];
        a[i] -= i * m;
    }
    int mx = 0;
    vector<int>v;
    v.pb(0);
    bool ok = 0;
    for(int i = 1;i<=n;i++){
        auto it = upper_bound(v.begin(),v.end(),a[i]);
        int ans = it - v.begin();
        if(v[v.size()-1]>=a[i]) v.pb(a[i]);
        else {
            if(ans==0) ok = 1;
            //cout << i << ' ' << ans << '\n';
            v[ans] = a[i];
        }
    }
    cout << n - (v.size() - (ok==0));
}

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