Submission #1164573

#TimeUsernameProblemLanguageResultExecution timeMemory
1164573PwoMoney (IZhO17_money)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n, a[1000005];
set<int> st;

int32_t main() {
	ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i];
	st.insert(n + 1);
  int ans = 0;
  int l = 1;
  while (l <= n) {
      int x = *st.upper_bound(a[l]);
      int r = l;
      while (r < n && a[r + 1] >= a[r] && a[r + 1] <= x)
          r++;
      ans++;
      for (int k = l; k <= r; k++)
          st.insert(a[k]);
      l = r + 1;
  }
	
	cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...