Submission #839033

#	Time	Username	Problem	Language	Result	Execution time	Memory
839033		rezaSetayesh	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	83 ms	4008 KiB

triusis

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int N = 2e5 + 5;
int n , a[N] , M;
vector <int> vec;

int main(){
    cin >> n >> M;
    for(int i = 1,x; i <= n; i++){
        a[i] = 2e9;
        cin >> x;
        if(x <= i * M)
            vec.push_back(i*M - x);
    }
    int mx = 0;
    for(int x : vec){
        int j = upper_bound(a , a + n + 1 , x) - a;
        a[j] = x;
        if(j > mx)mx = j;
    }
    cout << n - mx;
}

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