Submission #666960

#	Time	Username	Problem	Language	Result	Execution time	Memory
666960		Nursik	Climbers (RMI18_climbers)	C++14	0 / 100	281 ms	196128 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 = 5e3 + 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];
ll dp[maxn][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];
    }
    for (int i = 1; i <= n; ++i){
        for (int j = 1; j <= n; ++j){
            dp[i][j] = inf * inf;
        }
    }
    dp[2][n - 1] = min(a[2], a[n - 1]);
    for (int i = n - 1; i > 1; --i){
        for (int j = 1; j + i - 1 <= n; ++j){
            int l = j, r = j + i - 1;
            if (a[l + 1] <= a[r]){
                dp[l + 1][r] = min(dp[l + 1][r], dp[l][r] + abs(a[l + 1] - a[l]));    
            }
            if (a[r - 1] <= a[l]){
                dp[l][r - 1] = min(dp[l][r - 1], dp[l][r] + abs(a[r - 1] - a[r]));
            }
            if (a[l] == a[r] && l + 1 <= r - 1){
                int x = min(a[l + 1], a[r - 1]);
                dp[l + 1][r - 1] = min(dp[l + 1][r - 1], dp[l][r] + abs(a[l] - x));
            }
        }
    }
    ll ans = inf * inf;
    for (int i = 1; i <= n; ++i){
        ans = min(ans, dp[i][i]);
    }
    if (ans == inf * inf){
        cout << "NO\n";
        exit(0);
    }
    cout << ans;
}

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