Submission #333618

#	Time	Username	Problem	Language	Result	Execution time	Memory
333618		amunduzbaev	Money (IZhO17_money)	C++14	100 / 100	1492 ms	51692 KiB

money

#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
const int N = 1e6+6;

int a[N], n, ans;

int main(){
	cin>>n;
	set<int>s;
	s.insert(mod);
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=n;i++){
		ans ++;
		int need = *s.upper_bound(a[i]);
		s.insert(a[i]);
		while(a[i+1] >= a[i] && a[i+1] <= need && i+1 <= n){
			i++;
			s.insert(a[i]);
		}
	}
	cout<<ans<<"\n";
	return 0;
}

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