# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37448 | Kerim | Money (IZhO17_money) | C++14 | 1500 ms | 92208 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 1090009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
multiset<int>s;
int arr[MAXN];
int main(){
//~ freopen("file.in", "r", stdin);
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",arr+i);
int pos=-1;
for(int i=1;i<n;i++){
s.insert(arr[i]);
if(arr[i]>arr[i+1]){
pos=i+1;
break;
}
}
if(pos==-1){
puts("1");
return 0;
}
int ans=1;
while(1){
__typeof((s).begin())it=s.upper_bound(arr[pos]);
int right=INF;
if(it!=s.end())
right=*it;
int now=arr[pos],tmp=pos;
ans++;
for(int i=pos;i<=n;i++){
s.insert(arr[i]);
if(now<=arr[i] and arr[i]<=right)
now=arr[i];
else{
pos=i;
break;
}
}
if(tmp==pos)
break;
}
printf("%d\n",ans);
return 0;
}
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... |