Submission #934377

#TimeUsernameProblemLanguageResultExecution timeMemory
934377allin27xMoney (IZhO17_money)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h>
using namespace std;

int main(){
	int n; cin>>n;
	vector<int> a(n,0);
	for (int i=0; i<n; i++) cin>>a[i];
	int res = 1;
	set<int> t; t.insert(1e9);
	for (int i=0; i<n-1; i++){
		int x = a[i]; int y = a[i+1];
		if (x>y || *t.upper_bound(x) < y) res++;
		t.insert(a[i]);	
	}
	cout<<res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...