제출 #1323184

#제출 시각아이디문제언어결과실행 시간메모리
1323184yadav_nikhil1430Rabbit Carrot (LMIO19_triusis)C++20
0 / 100
2 ms336 KiB
#include<bits/stdc++.h>
using namespace std;
#define ll long long

signed main() {
    ll n,m;
    cin>>n>>m;
    vector<ll> a(n);
    for(int i=0;i<n;i++) {
        cin>>a[i];
        a[i]-=i*m;
        a[i]=-a[i];
    }
    vector<ll> lis;
    for(auto&x:a) {
        if(lis.size()==0 || lis.back()<=x)
            lis.emplace_back(x);
        else
            *upper_bound(lis.begin(),lis.end(),x);
    }
    cout<<lis.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...