제출 #1193928

#제출 시각아이디문제언어결과실행 시간메모리
1193928SulARabbit Carrot (LMIO19_triusis)C++20
0 / 100
1 ms324 KiB
#include <bits/stdc++.h> #define all(a) a.begin(), a.end() #define popcount(x) __builtin_popcountll(x) using namespace std; using namespace chrono; signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); // freopen("cowjog.in", "r", stdin); // freopen("cowjog.out", "w", stdout); int n,m; cin >> n >> m; vector<int> lis; for (int i = 1; i <= n; i++) { int a; cin >> a; a = i*m - a; if (a > 0) continue; auto it = lower_bound(all(lis), a); if (it == lis.end()) lis.push_back(a); else *it = a; } cout << n - lis.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...