Submission #52638917

---

Source Code Expand

/** NEVER GIVE UP ORION :)

 ****Author: OrionJaman

**/
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;
typedef long long int ll;

typedef long double ld;
typedef unsigned long long int ull;
#define L(i, j, k) for (ll i = (j); i < (k); i++)
// #define fors(i,s,n) for(ll i=s;i<n;i++)
// #define rfor(i,n) for(ll i=n;i>0;i--)
#define R(i, j, k) for (ll i = (j); i > (k); i--)
#define yes cout << "YES" << nl;
#define no cout << "NO" << nl;
#define nl "\n"
#define rtn return 0
#define bk break
#define ct continue
#define mp make_pair
#define f first
#define s second
#define va(a) vector<a>
#define se(a) set<a>
#define pa(a, b) pair<a, b>
#define ma(a, b) map<a, b>
#define qu(a) queue<a>
#define st(a) stack<a>
#define all(a) v.begin() v.end()
#define pp pop_back()
#define pb push_back
#define pnt(al)           \
    for (auto &a : al)    \
        cout << a << " "; \
    cout << nl;
#define fastcio()                     \
    ;                                 \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
int main()

{
    fastcio();
    ll t, k;
    cin >> t >> k;
    va(ll) h(t);
    for (auto &vl : h)
    {
        cin >> vl;
    }
    va(ll) dp(t, N);
    dp[0] = 0;
    // dp[1] = dp[0] + abs(h[1] - h[0]);
    L(i, 1, t)
    {

        L(j, 1, k + 1)
        {
            if (i - j >= 0)
            {
                dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
            }
            else
            {
                break;
            }
        }
    }
    // pnt(dp)
            cout
        << dp[t - 1] << nl;
    return 0;
}

Submission Info

Judge Result