Submission #1100361

#	Time	Username	Problem	Language	Result	Execution time	Memory
1100361		jassu12345	Rabbit Carrot (LMIO19_triusis)	C++11	0 / 100	1 ms	592 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define int long long

int mod = 1e9+7;

void solve() {
    int n,m;
    cin>>n>>m;
    int a[n];
    for(int i=0; i<n; i++)cin>>a[i];
    vector<int>temp,b;
    for(int i=0; i<n; i++){
        if(m*(i+1) >= a[i])
        b.pb((i+1)*m-a[i]);
    }
    int k=b.size();
    for(int i=0; i<k; i++){
        if(a[i]>0 && temp.empty())temp.pb(a[i]);
        else 
        if(a[i]>temp.back())temp.push_back(a[i]);
        else{
            int idx=upper_bound(temp.begin(),temp.end(),b[i])-temp.begin();
            temp[idx]=b[i];
        }
        
    }
    int sz;
    if(temp.empty())sz=0;
    else sz=temp.size();
    
   cout<<n-sz;
    
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;
    while (t--) {
        solve();
    }

    return 0;
}

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