Submission #413454

#TimeUsernameProblemLanguageResultExecution timeMemory
413454nkatoRabbit Carrot (LMIO19_triusis)C++17
100 / 100
34 ms4160 KiB
#include <bits/stdc++.h>

using namespace std;


int main() {


	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, m; cin >> n >> m;
    vector<int> a(n);
    for(int i = 0; i < n; i++) {
    	cin >> a[i];
   		a[i] = ((i+1)*m)-a[i];
    }


    vector<int> dp;
    for(int i = 0; i < (int)size(a); i++) {
    	if (a[i] < 0) continue;
    	int pos = int(upper_bound(begin(dp), end(dp), a[i])-begin(dp));

    	if (pos >= int(size(dp))) {
    		dp.push_back(a[i]);
    	} else dp[pos] = a[i];
    }

    cout << n - int(size(dp)) << endl;
    
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...