Submission #501935

#TimeUsernameProblemLanguageResultExecution timeMemory
501935SirCovidThe19thMoney (IZhO17_money)C++17
100 / 100
964 ms51272 KiB
#include <bits/stdc++.h> using namespace std; int n, ans, A[1000005]; set<int> S; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> A[i]; S.insert(1e9); for (int i = 0; i < n; i++){ ans++; auto mx = *S.upper_bound(A[i]); //vals must be in [A[l], mx] S.insert(A[i]); while (i < n - 1 and A[i + 1] >= A[i] and A[i + 1] <= mx) S.insert(A[++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...