| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 533570 | makanhulia | Money (IZhO17_money) | C++17 | 1249 ms | 55156 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 ll long long
#define fi first
#define se second
const ll MOD=1e9+7;
using namespace std;
ll N,a[1000005];
set <ll> s;
int main(){
cin>>N;
for(int i=1;i<=N;i++){
cin>>a[i];
}
ll catat=1;
ll temp=1e18;
for(int i=1;i<=N;i++){
if(i!=1){
if(a[i-1]>a[i]||a[i]>temp){
catat++;
auto it=s.upper_bound(a[i]);
if(it==s.end()){
temp=1e18;
}
else{
temp=*it;
}
}
}
s.insert(a[i]);
}
// cout<<endl;
cout<<catat<<endl;
}| # | 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... | ||||
