Submission #464248

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

money

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int mxN = 1e6+10;
int N, A[mxN], ans;

void solve() {
	cin >> N;
	for (int i = 0; i < N; i++)
		cin >> A[i];
	multiset<int> mst;
	for (int i = 0; i < N; i++) {
		int j = i+1;
		auto it = mst.lower_bound(A[i]);
		while(j < N && (A[j] >= A[j-1]) && (it == mst.end() || *it >= A[j]))
			j++;
		for (int ii = i; ii < j; ii++)
			mst.insert(A[ii]);
		i = j-1;
		ans++;
	}
	cout << ans;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	solve();
}

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