Submission #934374

#TimeUsernameProblemLanguageResultExecution timeMemory
934374allin27xMoney (IZhO17_money)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; vector<int> a(n,0); for (int i=0; i<n; i++) cin>>a[i]; int res = 1; set<int> t; t.insert(1e9); for (int i=0; i<n-1; i++){ t.insert(a[i]); int x = a[i]; int y = a[i+1]; if (x>y) {res++; continue;} if (*t.upper_bound(x) < y) res++; } cout<<res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...