제출 #591825

#제출 시각아이디문제언어결과실행 시간메모리
591825BelguteiRabbit Carrot (LMIO19_triusis)C++17
100 / 100
86 ms9692 KiB
#include <bits/stdc++.h>

using namespace std;

const int N = 200005;
int n,m;
int a;
multiset<int> s;
multiset<int> :: iterator it;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n; i ++) {
        cin >> a;
        if(a > m * i) continue;
        int tmp = m * i - a;
        it = s.upper_bound(tmp);
        if(it != s.end()) 
            s.erase(it);
        s.insert(tmp);
    }
    cout << n - s.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...