# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
38624 | Yusup01 | Money (IZhO17_money) | C++14 | 0 ms | 2564 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 i,jog=1,k,l,m,n,a[100009];
vector<int>b;
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n; for(int i=1; i<=n; i++) cin>>a[i];
for(i=1; i<=n; i++)
{
if(a[i]>=a[i-1]) b.push_back(a[i]);
else break;
}
for(;i<=n; i++)
{
if(k==1)
{
for(int j=0; j<b.size(); j++)
{
if(a[i]<=b[j]) m=b[j];
}
}
b.clear(); b.push_back(a[i]); i++;
if(a[i]<=m&&a[i]>=a[i-1]) {k=0; b.push_back(a[i]);}
else {k=1; jog++;}
}
if(jog>1) jog++;
cout<<jog;
}
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... |