Submission #901521

#	Time	Username	Problem	Language	Result	Execution time	Memory
901521		OAleksa	Money (IZhO17_money)	C++14	45 / 100	1540 ms	23788 KiB

money

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
const int N = 1e6 + 69;
int n, a[N], dp[N];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1;i <= n;i++) {
  	cin >> a[i];
  	dp[i] = 1e9;
  }
  set<int> st;
  dp[0] = 0;
  st.insert(0);
  st.insert(1e9);
  for (int i = 1;i <= n;i++) {
  	dp[i] = min(dp[i], dp[i - 1] + 1);
  	for (auto u = st.begin();u != st.end();u++) {
  		auto t = u;
  		++t;
  		if (*u > a[i])
  			break;
  		int x = *u, y = *t;
  		int j = i + 1;
  		while (j <= n && a[j] >= x && a[j] <= y && a[j] >= a[j - 1])
  			j++;
  		for (int k = i;k < j;k++)
  			dp[k] = min(dp[k], dp[i - 1] + 1);
  	}
  	st.insert(a[i]);
  }
  cout << dp[n];
  return 0;
}

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