# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
197576 | nafis_shifat | Money (IZhO17_money) | C++14 | 2 ms | 380 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 pii pair<int,int>
#define ll long long
#define f first
#define s second
using namespace std;
int main()
{
//freopen("input.txt","r",stdin);
int n;
cin>>n;
int a[n+3];
vector<pii> v;
int l=1;
a[0]=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
if(a[i]<a[i-1])
{
v.push_back(make_pair(l,i-1));
l=i;
}
}
v.push_back(make_pair(l,n));
multiset<int> st;
for(int i=1;i<=v[0].s;i++)st.insert(a[i]);
int res=1;
for(int i=1;i<v.size();i++)
{
int p=v[i].f;
while(p<=v[i].s)
{
multiset<int>::iterator it=st.upper_bound(a[p]);
int val=*it;
if(val<=a[p])
{
for(int i=p;i<=v[i].s;i++)st.insert(a[i]);
res++;
p=v[i].s+1;
continue;
}
while(a[p]<=val && p<=v[i].s)
{
st.insert(a[p]);
p++;
}
res++;
}
}
cout<<res<<endl;
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... |