Submission #474922

#TimeUsernameProblemLanguageResultExecution timeMemory
474922ismoilovMoney (IZhO17_money)C++14
100 / 100
1179 ms51396 KiB
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

const int maxx = 1e7+7;

void S()
{
	int n, ans = 1;
	cin >> n;
	set <int> s;
	vector <int> a(n);
	int mx = maxx;
	for(int i = 0; i < n; i ++){
		cin >> a[i];
		if(i == 0){
			s.insert(a[i]);
			continue;
		}
		if(a[i] < a[i-1] || a[i] > mx){
			ans ++;
			auto it = s.lower_bound(a[i]+1);
			if(it == s.end())
				mx = maxx;
			else
				mx = *it;
		}
		s.insert(a[i]);
	}
	cout << ans << "\n";
}

int main()
{
	IOS;
	/*int t;
	cin >> t;
	while(t --)*/
		S();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...