Submission #487216

#	Time	Username	Problem	Language	Result	Execution time	Memory
487216		Karuk	Climbers (RMI18_climbers)	C++14	0 / 100	1095 ms	204 KiB

climbers

#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++)
    {
        cin>>a[i];
        if(i>0)
        {
            sum+=abs(a[i]-a[i-1]);
            maxi=max(maxi,abs(a[i]-a[i-1]));
        }
        if(i>0 && i<n-1)
        {
            if(a[i]>a[i-1] && a[i+1]>a[i])for(;;);
            if(a[i]<a[i-1]&&a[i+1]<a[i])for(;;);
        }
    }
    cout<<sum-maxi<<endl;
}
int main()
{
    solve();
    return 0;
}

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