제출 #92510

#제출 시각아이디문제언어결과실행 시간메모리
92510Nodir_BobievMoney (IZhO17_money)C++14
45 / 100
1565 ms51244 KiB
# include <iostream>
# include <set>

using namespace std;

const int N = 1e6 + 100;

int n;
int a[N], cnt, ans = 1;
set < int > st;

int main()
{
	cin >> n;
	
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	
	st.insert(1111111);
	
	for (int i = 1; i <= n; i++){
		set < int > :: iterator lw;
		
		lw = st.upper_bound(a[i - cnt]);
		if(*lw >= a[i] && a[i] >= a[i - 1])
			cnt++;
		
		else{
			ans++;
			
			for (int j = i - cnt; j < i; j++)
				st.insert(a[j]);
			
			cnt = 1;
		}
		
	}
	cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...