Submission #758359

#TimeUsernameProblemLanguageResultExecution timeMemory
758359haxormanMoney (IZhO17_money)C++14
0 / 100
0 ms212 KiB
#include <bits/stdc++.h> using namespace std; const int mxN = 1e6 + 7; int arr[mxN]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; for (int i = 0; i < n; ++i) { cin >> arr[i]; } arr[n] = INT_MIN; int ans = 0, prv = 0; set<int> vals; for (int i = 1; i <= n; ++i) { vals.insert(arr[i - 1]); auto it1 = vals.upper_bound(arr[prv]); if (arr[i - 1] > arr[i] || (it1 != vals.end() && *it1 < arr[i])) { ++ans; prv = i; } } cout << ans << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...