Submission #135224

#TimeUsernameProblemLanguageResultExecution timeMemory
135224FedericoSMoney (IZhO17_money)C++14
0 / 100
2 ms376 KiB
#include <iostream> #include <set> using namespace std; int N; int A[1000006]; set<int> S; int ans; int main(){ cin>>N; for(int i=0;i<N;i++) cin>>A[i]; S.insert(N+1); for(int i=0;i<N-1;i++){ if((A[i]>A[i+1]) or (A[i]<A[i+1] and (*S.lower_bound(A[i]))<A[i+1])) ans++; S.insert(A[i]); } cout<<ans+1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...