제출 #173535

#제출 시각아이디문제언어결과실행 시간메모리
173535AllMightMoney (IZhO17_money)C++14
0 / 100
2 ms376 KiB
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

const int N = 1000006;
const int INF = 100000009;

int n;
int a[N];

bool color[N];

int main()
{
	ios_base::sync_with_stdio(false);

	cin >> n;

	for (int i = 0; i < n; i++)
		cin >> a[i];

	int ans = 0, mn = INF, mx = -INF;
	for (int i = 0; i < n - 1; i++) {
		int l = a[i];
		while (i < n - 1 && a[i] < a[i + 1])	i++;
		int r = a[i];
		
		if ((l < mx && mx < r) || (l < mn && mn < r))
			ans++;

		mn = min(mn, l), mx = max(mx, r);
		ans++;
	}

	cout << ans << endl;

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...