Submission #1153324

#TimeUsernameProblemLanguageResultExecution timeMemory
1153324sodbayrRabbit Carrot (LMIO19_triusis)C++20
100 / 100
19 ms5052 KiB
#include <bits/stdc++.h> #define ll long long #define ff first #define pb push_back #define endl "\n" #define ss second using namespace std; ll n,k,a,l; vector<ll> x,z; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>>n>>k; for(ll i=1;i<=n;i++){ cin>>a; a=i*k-a; if(a>=0){ x.pb(a); } } for(ll i=0;i<x.size();i++){ l=upper_bound(z.begin(),z.end(),x[i])-z.begin(); //cout<<x[i]<<' '<<l<<endl; if(l==z.size()){ z.pb(x[i]); } else{ z[l]=x[i]; } } cout<<n-z.size(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...