# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
487217 | Karuk | Climbers (RMI18_climbers) | C++14 | 2 ms | 332 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;
void solve()
{
int n;
cin>>n;
vector<int>a(n);
int maxi=0,sum=0;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
if(a.size()>0 && a.size()%2 && x>a[a.size()-1])a[a.size()-1]=x;
else if(a.size()>0 && a.size()%2==0 && x<a[a.size()-1])a[a.size()-1]=x;
else a.push_back(x);
}
for(int i=0;i<a.size();i++)
{
if(i>0)
{
sum+=abs(a[i]-a[i-1]);
maxi=max(maxi,abs(a[i]-a[i-1]));
}
}
cout<<sum-maxi<<endl;
}
int main()
{
solve();
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... |