Submission #882130

#	Time	Username	Problem	Language	Result	Execution time	Memory
882130		iag99	Rabbit Carrot (LMIO19_triusis)	C++17	0 / 100	0 ms	348 KiB

triusis

#include <bits/stdc++.h>
using namespace std;

const int MAX_SWAPS=465;
int lis = 0;
multiset<int> s;
int main() {
	//freopen("cowjog.in", "r", stdin);
	//freopen("cowjog.out", "w", stdout);
	iostream::sync_with_stdio(false);
	cin.tie(0);
	/*
	 * 13 3 366 -43 11 -6 -20 20 4
	 */
	 int n,m;
	 cin>>n>>m;
	 vector<int> a(n);
	 for(int i=0; i<n; i++)
	 {
		 cin>>a[i];
	 }
	 vector<int> s;
	 for(int i=1; i<=n; i++)
	 {
		 if(i*m>=a[i-1])
		 {
			 s.push_back(i*m-a[i-1]);
		 }
	 }
	 vector<int> ans;
	 for(int x : a)
	 {
		 if(lower_bound(ans.begin(), ans.end(),x)==ans.end())
		 {
			 ans.push_back(x);
		 }
		 else
		 {
			 int in=lower_bound(ans.begin(), ans.end(),x)-ans.begin();
			 ans[in]=x;
		 }
	 }
	 cout<<ans.size()<<endl;
	 return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37