Submission #487223

#	Time	Username	Problem	Language	Result	Execution time	Memory
487223		Karuk	Climbers (RMI18_climbers)	C++17	0 / 100	2 ms	332 KiB

climbers

#include<bits/stdc++.h>
using namespace std;
void solve()
{
    int n;
    cin>>n;
    vector<int>a;
    long long 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<(int)a.size();i++)
    {
        if(i>0)
        {
            sum+=abs(a[i]-a[i-1]);
            maxi=max(maxi,(long long)abs(a[i]-a[i-1]));
        }
    }
    cout<<sum-maxi<<endl;
}
int main()
{
    solve();
    return 0;
}

• Subtask 1: 0 / 25
• Subtask 2: 0 / 25
• Subtask 3: 0 / 50