Submission #664457

#	Time	Username	Problem	Language	Result	Execution time	Memory
664457		Nursik	Climbers (RMI18_climbers)	C++14	0 / 100	1093 ms	368 KiB

climbers

#include <stdio.h>

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
//#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ld long double

const ll maxn = 1e5 + 1, maxm = 1e6 + 1;
const ll mod = 1e9 + 7, inf = 1e9, block = 550, hb = 31, base = 1000050017, biginf = 5e18;
const ld eps = 1e-9;

int n;
int a[maxn];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0); 
    cin >> n;
    for (int i = 1; i <= n; ++i){
        cin >> a[i];
    }
    ll ans = 0;
    int l = 2, r = n - 1;
    ans += min(a[l], a[r]);
    while (l != r){
        if (a[l] < a[r]){
            while (l + 1 <= r && a[l + 1] <= a[r]){
                ans += abs(a[l] - a[l + 1]);
                l += 1;
            }
        }
        else{
            while (r - 1 >= l && a[r - 1] <= a[l]){
                ans += abs(a[r] - a[r - 1]);
                r -= 1;
            }
        }
    }
    cout << ans;
}

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