[브2] 17608 - 막대기

#include <iostream>
using namespace std;

int main() 
{
	int n;
	cin >> n;
	vector<int> v(n);

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

	int cnt = 0, max = 0;

	for (int i = n - 1; i >= 0; i--)
	{
		if (v[i] > max)
		{
			max = v[i];
			cnt++;
		}
	}
	cout << cnt;
}