# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
540957 | Kiarat | Money (IZhO17_money) | C++14 | 0 ms | 212 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;
typedef long long ll;
vector <pair<ll,ll>> v;
int main(){
ll n;
cin >> n;
ll a[n+1];
for(int i=1;i<=n;i++)
{
cin >> a[i];
}
a[n+1] = -10;
ll ans=0;
ll sum=0;
ll cnt=0,ss=100000;
for(ll i=2;i<=n+1;i++){
if(a[i-1] <= a[i]){
ss = min(a[i-1],ss);
cnt = max(a[i],cnt);
}
else{
v.push_back({ss,cnt});
cnt=0,ss=100000;
sum++;
}
}
sort(v.begin(),v.end());
for(int i=1;i<v.size();i++){
if(v[i].first >= v[i-1].first && v[i].second <= v[i-1].second){
continue;
}
else if(v[i].first >= v[i-1].first && v[i].second >= v[i-1].second){
continue;
}
else{
sum++;
}
}
cout << sum;
}
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... |