Sherlock and Cost Discussions | Algorithms | HackerRank
We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Dynamic Programming
  4. Sherlock and Cost
  5. Discussions

Sherlock and Cost

  • dehaka
     + 0 comments

    tricky question, the reasoning is far longer than the algorithm

    O(n)

    int cost(vector<int> B) {
    pair<int, int> Q = {0, 0};
    for (int i=1; i < B.size(); i++) Q = {max(Q.first, Q.second + B[i-1] - 1), max(Q.first + B[i] - 1, Q.second + abs(B[i]- B[i-1]))};
    return max(Q.first, Q.second);
}