제출 #433393

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
433393		MohammadAghil	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	102 ms	14648 KiB

triusis

#include <bits/stdc++.h> 
using namespace std;
typedef long long ll;
#define rep(i,l,r) for(int i = l; i < r; i++)
#define per(i,r,l) for(int i = r; i >= l; i--)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define ss second 

const ll mod = 998244353, maxn = 2e5 + 5, inf = 1e9 + 5;

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ll n, m;
    cin >> n >> m;
    vector<ll> t(n + 1), a;
    rep(i,1,n + 1){
        ll k; cin >> k;
        t[i] = (ll)1LL*m*i - k;
    }
    rep(i,1,n + 1) if(t[i] >= 0) a.pb(t[i]);
    multiset<ll> s;
    rep(i,0,sz(a)){
        auto it = s.upper_bound(a[i]);
        if(it != s.end()) s.erase(it);
        s.insert(a[i]);
    }
    cout << n - sz(s);
    return 0;
}

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