# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671612 | smartmonky | Money (IZhO17_money) | C++14 | 952 ms | 55232 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;
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
set <int> st;
vector <int> v(n + 1);
int ans = 0;
st.insert(1e9);
for(int i = 1; i <= n; i++){
cin >> v[i];
}
v[0] = -1e9;
//v[n + 1]
for(int i = 1; i <= n; i++){
auto top = st.upper_bound(v[i]);
bool flag = 0;
int ev = 0;
if(*top == 1e9)
flag = 1;
else
ev = *top;
while(i <= n && v[i + 1] >= v[i] && (v[i + 1] <= ev || flag)){
st.insert(v[i]);
i++;
}
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... |