# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
366073 | mahmoudbadawy | Money (IZhO17_money) | C++17 | 1301 ms | 58348 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;
const int N=1e6+6;
set<int> ss;
vector<int> v;
int n;
int arr[N];
int main()
{
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&arr[i]);
ss.insert((1<<30));
v.push_back(arr[0]);
int ans=1;
for(int i=1;i<n;i++)
{
if(arr[i]<v.back() || arr[i]>(*ss.upper_bound(v[0])))
{
//cout << arr[i] << " " << v.back() << " " << (*ss.lower_bound(arr[i])) << " " << (*ss.lower_bound(v.back())) << endl;
for(int j:v) ss.insert(j);
ans++;
v.clear();
}
v.push_back(arr[i]);
}
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... |