Submission #1343880

#TimeUsernameProblemLanguageResultExecution timeMemory
1343880minhtienRabbit Carrot (LMIO19_triusis)C++20
100 / 100
63 ms6584 KiB
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2e5+6;
const int inf=1e9+7;
vector<ll>v,v1;
ll n,k;
ll a[N],a1[N];
int main()
{
    cin >>n >>k;
    ll tong=k;
    int dem=0;
    for(int i=1;i<=n;i++){
        cin >> a[i];
        if(i*k-a[i]>=0){
            v1.push_back(i*k-a[i]);
        }
    }
    for(auto x:v1){
        int t=upper_bound(v.begin(),v.end(),x)-v.begin();
        if(t==v.size()){
            v.push_back(x);
        }
        else{
            v[t]=x;
        }
    }
    int s1=v.size();
    cout << n-s1;
    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...