Submission #333615

#	Time	Username	Problem	Language	Result	Execution time	Memory
333615		amunduzbaev	Money (IZhO17_money)	C++14	45 / 100	1502 ms	51644 KiB

money

#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
int main(){
	int n;
	cin>>n;
	vector<int>a(n);
	set<int>s;
	s.insert(mod);
	for(int i=0;i<n;i++) cin>>a[i];
	int ans = 0;
	for(int i=0;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: 0 / 55