제출 #1343608

#제출 시각아이디문제언어결과실행 시간메모리
1343608jumpRabbit Carrot (LMIO19_triusis)C++20
100 / 100
63 ms2580 KiB
#include <bits/stdc++.h>
#define int long long

int n,m;
signed main(){
	std::cin >> n >> m;
	std::vector<int> lis;
	for(int i=1;i<=n;i++){
		int in;
		std::cin >> in;
		if(in>(i*m))continue;
		auto itr = std::upper_bound(lis.begin(),lis.end(),i*m-in);
		if(itr==lis.end()){
			lis.push_back(i*m-in);
		}
		else{
			*itr=i*m-in;
		}
	}
	std::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...