제출 #1229828

#제출 시각아이디문제언어결과실행 시간메모리
1229828who-read-is-dogRabbit Carrot (LMIO19_triusis)C++20
100 / 100
53 ms3516 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; const int N = 2e5 + 5; vector<int> a(N); vector<int> v, ok; int main(){ int n; cin >> n; int m; cin >> m; for(int i = 1; i <= n; i++){ cin >> a[i]; if(a[i] <= m*i) v.push_back(m*i - a[i]); } for(auto x : v){ auto res = upper_bound(ok.begin(), ok.end(), x); if(res == ok.end()) ok.push_back(x); else *res = x; } cout << n - ok.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...