Submission #390691

#	Time	Username	Problem	Language	Result	Execution time	Memory
390691		SavicS	Money (IZhO17_money)	C++14	100 / 100	1279 ms	51240 KiB

money

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 1000005;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n;
int niz[maxn];

int main() 
{
	ios::sync_with_stdio(false);
	cout.tie(nullptr);
	cin.tie(nullptr);
	cin >> n;
	ff(i,1,n)cin >> niz[i];

	// prvi segment ide sve dok je rastuci

	multiset<int> ms;
	ms.insert(-inf);
	ms.insert(inf);

	ms.insert(niz[1]);


	int o = 1;
	while(o + 1 <= n && niz[o + 1] >= niz[o]) {
		o += 1;
		ms.insert(niz[o]);
	}

	int br = 1;
	ff(i,o + 1,n) {
		br += 1;

		auto gde = ms.upper_bound(niz[i]);

		int j = i;
		while(j + 1 <= n && niz[j + 1] >= niz[j] && *gde >= niz[j + 1]) {
			j += 1;
		}

		ff(l,i,j)ms.insert(niz[l]);
		i = j;

	}

	cout << br << endl;

	return 0;
}
/**

10
5 3 5 5 8 2 3 7 5 10

6
3 6 4 5 1 2

// probati bojenje sahovski ili slicno

**/

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