Submission #535189

#TimeUsernameProblemLanguageResultExecution timeMemory
535189andecaandeciMoney (IZhO17_money)C++17
100 / 100
1014 ms47372 KiB
#include <bits/stdc++.h> #define REP(v, i, j) for (long long v = i; v != j; v++) #define FORI(v) for (auto i : v) #define FORJ(v) for (auto j : v) #define OUT(v, a) FORI(v) cout << i << a; #define OUTS(v, a, b) cout << v.size() << a; OUT(v, b) #define in(a, n) REP(i, 0, n) cin >> a[i]; #define SORT(v) sort(begin(v), end(v)) #define REV(v) reverse(begin(v), end(v)) #define pb push_back #define fi first #define se second #define detachIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); using namespace std; typedef pair<long long, long long> pii; typedef pair<pii, long long> piii; typedef pair<pii, pii> piiii; set<long long> st; vector<long long> v; int main() { detachIO; long long N; long long prev = 1E10, ub = 1E10, ans = 0; ; cin >> N; while (N--) { long long x; cin >> x; if (prev > x || x > ub) { ans++; if (st.upper_bound(x) != st.end()) ub = *st.upper_bound(x); else ub = 1E10; } prev = x; st.insert(x); } 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...