Slope Hack ✭ < DIRECT >

for (int i = 1; i <= n; i++) x - k

priority_queue<long long> left; // max-heap priority_queue<long long, vector<long long>, greater<long long>> right; // min-heap long long ans = 0; slope hack

#include <bits/stdc++.h> using namespace std; int main() int n; cin >> n; for (int i = 1; i &lt;= n;

Slope trick code (C++):

What is the Slope Hack? The slope hack (also known as the "convex trick" or "slope trick" in competitive programming) is a technique for optimizing DP (Dynamic Programming) transitions of the form: for (int i = 1

[ dp[i] = \min_j < i (dp[j] + |a_i - a_j| \cdot C + \textconstant) ]