# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671613 | Baytoro | Money (IZhO17_money) | C++17 | 956 ms | 55252 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
void fopn(string name){
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
const int INF=1e9+9,mod=1e9+7;
int n,m;
void solve(){
cin>>n;
vector<int> vec(n);
for(int i=0;i<n;i++)
cin>>vec[i];
set<int> st;
auto it=st.end();
int res=0;
int last=-1;
for(int i=0;i<n;i++){
auto it2=st.lower_bound(vec[i]);
auto it3=st.upper_bound(vec[i]);
if(vec[i]<last || (it2!=it && it3!=it)){
res++;
it=it3;
}
st.insert(vec[i]);
last=vec[i];
}
cout<<res+1<<endl;
}
main(){
ios;
int T=1;
//cin>>T;
while(T--){
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |