Submission #365129

#	Time	Username	Problem	Language	Result	Execution time	Memory
365129		MohamedAhmed04	Money (IZhO17_money)	C++14	100 / 100	1269 ms	58116 KiB

money

#include <bits/stdc++.h>

using namespace std ;

const int MAX = 1e6 + 10 ;

int arr[MAX] ;
int n ;

set<int>s ;

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n ;
	for(int i = 0 ; i < n ; ++i)
		cin>>arr[i] ;
	int x = -1 , ans = 0 ;
	for(int i = 0 ; i < n ; ++i)
	{
		if(arr[i] <= x && arr[i] >= arr[i-1])
			s.insert(arr[i]) ;
		else
		{
			ans++ ;
			if(!s.size() || (*s.rbegin()) <= arr[i])
				x = 1e9 ;
			else 
				x = *s.upper_bound(arr[i]) ;
			s.insert(arr[i]) ;
		}
	}
	return cout<<ans<<"\n" , 0 ;
}		

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 20 / 20
• Subtask 4: 55 / 55