Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Ссылка на задачу https://acmp.ru/index.asp?main=task&id_task=29
- #include <iostream>
- #include <algorithm>
- using namespace std;
- int main()
- {
- unsigned n;
- cin >> n;
- long long int arr[n], dist[n];
- for (int i = 0; i < n; ++i)
- {
- cin >> arr[i];
- }
- dist[0] = 0;
- for (int i = 1; i < n; ++i)
- {
- if (i == 1)
- dist[1] = abs(arr[1] - arr[0]);
- else
- {
- long long int a = dist[i-1] + abs(arr[i] - arr[i-1]);
- long long int b = dist[i-2] + 3*abs(arr[i] - arr[i-2]);
- dist[i] = (a < b) ? a : b;
- }
- }
- cout << dist[n-1] << endl;
- return 0;
- }
Add Comment
Please, Sign In to add comment