제출 #1285663

#제출 시각아이디문제언어결과실행 시간메모리
1285663Jawad_Akbar_JJMoney (IZhO17_money)C++20
100 / 100
999 ms51300 KiB
#include <iostream>
#include <set>

using namespace std;
int a[1<<20];

int main(){
	set<int> st;
	int n, Ans = 0;
	cin>>n;

	for (int i=1;i<=n;i++)
		cin>>a[i];
	
	for (int i=1;i<=n;){
		auto u = st.upper_bound(a[i]);
		int L = 0, R = 2e9, j = i;
		if (u != begin(st))
			L = *prev(u);
		if (u != end(st))
			R = *u;

		while (j <= n and a[j] <= R and a[j] >= L)
			L = a[j++], st.insert(L);
		i = j, Ans++;
	}
	cout<<Ans<<'\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...