제출 #1306037

#제출 시각아이디문제언어결과실행 시간메모리
1306037xnoelRabbit Carrot (LMIO19_triusis)C++20
0 / 100
3 ms712 KiB
#include <bits/stdc++.h> using namespace std; int main(){ long long n,jump; cin>>n>>jump; vector<long long> a(n); for (long long i=0;i<n;i++) cin>>a[i]; reverse(a.begin(),a.end()); long long curr=0; for (long long i=0;i<n;i++) { a[i]+=curr; curr+=jump; } // for (auto num:a) cout<<num<<" "; // cout<<"\n"; vector<long long> dp; for (auto num:a) { auto it = upper_bound(dp.begin(),dp.end(),num); if (it==dp.end()) dp.push_back(num); else *it = num; } cout<<n-dp.size()<<"\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...