# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
385032 | zoooma13 | Money (IZhO17_money) | C++14 | 1227 ms | 58164 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;
int main()
{
int n;
scanf("%d",&n);
vector <int> a(n);
for(int&i : a)
scanf("%d",&i);
set <int> s{INT_MAX};
int ans = 1 ,lst = 0;
for(int i = 1; i < n; i++){
if(a[i] < a[i-1] || *s.upper_bound(a[lst]) < a[i]){
for(int j = lst; j < i; j++)
s.insert(a[j]);
lst = i;
ans++;
}
}
printf("%d\n",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... |