招银2018[编程题]小招喵跑步

#include <iostream>
//#include <algorithm>
using namespace std;

#define min(a, b) (((a)<(b))?(a):(b))

int minSteps(int n) {
    int result = 0;
    if (n < 0) n = -1 * n;

    //动态规划方法
    if (n == 0) return 0;
    if (n == 1) return 1;
    int *steps = new int[n + 1];
    steps[0] = 0;
    steps[1] = 1;
    for (int i = 2; i <= n; i++) {
        if (i % 2 == 0)
            steps[i] = min(steps[i - 1], steps[i / 2]) + 1;
        else
            steps[i] = min(steps[i - 1], steps[(i + 1) / 2] + 1) + 1;
    }
    result = steps[n];
    delete[]steps;
    return result;
}

int main() {
    int n;
    cin >> n;
    cout << minSteps(n) << endl;
    return 0;
}