제출 #920955

#제출 시각아이디문제언어결과실행 시간메모리
920955sleepntsheepRabbit Carrot (LMIO19_triusis)C++17
100 / 100
22 ms3996 KiB
#include <iostream> #include <fstream> #include <iomanip> #include <cmath> #include <cassert> #include <cstring> #include <vector> #include <algorithm> #include <deque> #include <set> #include <utility> #include <array> #include <complex> #include <ranges> using namespace std; #define ShinLena cin.tie(nullptr)->sync_with_stdio(false); int n, m, z; long long b; vector<long long> v; int main() { ShinLena; cin >> n >> m; for (int i = 1; i <= n; ++i) { long long a; cin >> a; a -= 1ll * m * i; if (a <= 0) { a = -a; auto it = upper_bound(v.begin(), v.end(), a); if (it == v.end()) v.push_back(a); else *it = a; } } cout << n - v.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...