# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671599 | smartmonky | Money (IZhO17_money) | C++14 | 0 ms | 212 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>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
using namespace std;
const int N = 500001;
int f[N],s[N], pos[N];
int n;
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
set <int> st;
vector <int> v(n + 1);
int ans = 1;
st.insert(1e9);
for(int i = 1; i <= n; i++){
cin >> v[i];
}
st.insert(v[1]);
for(int i = 2; i <= n; i++){
auto it = st.lower_bound(v[i - 1]);
if(*it == 1e9 || *it > v[i]){
st.insert(v[i]);
continue;
}else{
st.insert(v[i]);
ans++;
}
}
cout << ans;
}
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... |