# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
340276 | Tosic | Money (IZhO17_money) | C++14 | 1415 ms | 58220 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 maxn 1000010
using namespace std;
int n, a[maxn], ans;
multiset<int> aN;
int main(){
ios_base::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
cin >> n;
vector<int> res;
int grV = 1e9;
for(int i = 0; i < n; ++i){
cin >> a[i];
if(res.empty() or a[i] >= res.back() and a[i] <= grV){
res.push_back(a[i]);
} else {
for(auto j:res){
aN.insert(j);
}
res.clear();
++ans;
res.push_back(a[i]);
if(aN.upper_bound(a[i]) == aN.end()){
grV = 1e9;
} else {
grV = *aN.upper_bound(a[i]);
}
}
}
if(!res.empty()){
++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... |