제출 #533568

#제출 시각아이디문제언어결과실행 시간메모리
533568christinelynnMoney (IZhO17_money)C++17
9 / 100
1 ms204 KiB
#include <bits/stdc++.h> #define ll long long #define fi first #define se second const ll MOD=1e9+7; using namespace std; ll N,a[1000005]; set <ll> s; int main(){ cin>>N; for(int i=1;i<=N;i++){ cin>>a[i]; } ll catat=1; ll temp=1e18; for(int i=1;i<=N;i++){ if(i!=1){ if(a[i-1]>a[i]||a[i]>temp){ catat++; auto it=s.upper_bound(a[i]); temp=*it; } } s.insert(a[i]); } // cout<<endl; cout<<catat<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...