Submission #526509

#	Time	Username	Problem	Language	Result	Execution time	Memory
526509		Mr_Husanboy	Money (IZhO17_money)	C++14	0 / 100	1 ms	204 KiB

money

// Muallif: Mansuraliyev Husanboy Murotali o'g'li  >> NamPS

#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define ios ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(a) a.begin(), a.end()
#define F first
#define S second
// 0-9 >> 48-57;    A-Z>>65-90   and   a-z>>97-122 respectively;	
const int N=1e6+5;


void solve(){
	int n; cin>>n;
	int a[n];
	for(int i=0;i<n;i++) cin>>a[i];
	int init=0; set<int> st,bef;
	st.insert(a[0]); int ans=1;
	for(int i=1;i<n;i++){
		if(a[i]>=a[i-1]){
			init++;st.insert(a[i]);
		}else break;
	}//cout<<init<<"in\n";
	ans++;
	for(int i=init+2;i<n;i++){
		if(a[i]==a[i-1]){
			continue;
		}
		if(a[i]>a[i-1]){
			bef.insert(a[i-1]);
			auto k=st.lower_bound(a[i-1]+1);
			auto k1=st.lower_bound(a[i]);
			if(k!=k1){
				for(auto u:bef){
					st.insert(u);
				}ans++;
				bef.clear();
			}
			
		}else{
			st.insert(a[i-1]);
			ans++;
		}
	}
	cout<<ans<<"\n";
}


int main(){
	ios; 
	//int t=1;   cin>>t; while(t--)
	solve();
}

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