Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- using namespace std;
- int main()
- {
- int n;
- cin >> n;
- vector <int> dp(n);
- vector <int> a(n);
- for (int i = 0; i<n; i++) {
- cin >> a[i];
- } dp[0]=a[0];
- dp[1]=abs(a[1]-a[0]);
- for (int i = 2; i<n; i++) {
- dp[i] = min(abs(a[i] - a[i-1]) + dp[i - 1], 3 * abs(a[i] - a[i-2]) + dp[i - 2]);
- }
- cout << dp[n-1];
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement