Submission #1187583

#TimeUsernameProblemLanguageResultExecution timeMemory
1187583ffeyyaae_Rabbit Carrot (LMIO19_triusis)C++20
100 / 100
16 ms2244 KiB
#include <bits/stdc++.h> using namespace std; const int N = 2e5+5; int n, M; int keep[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> M; for( int i=1;i<=n;i++ ) { int a; cin >> a; keep[i] = M*i - a; } vector<int> vec; for( int i=1;i<=n;i++ ) { if( keep[i] < 0 ) continue; int idx = upper_bound( vec.begin(), vec.end(), keep[i] )-vec.begin(); if( idx == vec.size() ) vec.push_back( keep[i] ); else vec[idx] = keep[i]; } cout << n-vec.size(); 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...