Submission #1140627

#TimeUsernameProblemLanguageResultExecution timeMemory
1140627NurislamMoney (IZhO17_money)C++20
100 / 100
729 ms51228 KiB
#include <bits/stdc++.h> 
using namespace std;


int main(){
	int n;
	cin >> n;
	vector<int> a(n);
	
	for(int &i : a) cin >> i;
	
	set<int> st;
	int ans = 0;
	for(int i = 0; i < n; ){
		auto r = st.upper_bound(a[i]);
		
		st.insert(a[i]);
		int j = i + 1;
		while(j < n && a[j-1] <= a[j] && (r == st.end() || *r  >= a[j]))
			st.insert(a[j++]);
			
		ans ++;
		i = j;
	};
	
	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...