Scribd Logo
Upload

Welcome to Scribd!

  • Third File

    Uploaded by

    gung
    6 views1 page
    The document displays an AlgoExpert coding interface with options to view solutions, explanations, and run code. It also shows the code for a function that takes in an array of scores and returns the minimum rewards needed to ensure lower scores get a lower reward than higher scores. The function does this in O(n) time and O(n) space by initializing an output array with rewards of 1, then increasing rewards of higher scores on the first pass and taking the maximum of the current or next reward on the second pass.

    Original Description:

    Original Title

    third_file

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document displays an AlgoExpert coding interface with options to view solutions, explanations, and run code. It also shows the code for a function that takes in an array of scores and returns the minimum rewards needed to ensure lower scores get a lower reward than higher scores. The function does this in O(n) time and O(n) space by initializing an output array with rewards of 1, then increasing rewards of higher scores on the first pass and taking the maximum of the current or next reward on the second pass.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views1 page

    Third File

    Uploaded by

    gung
    The document displays an AlgoExpert coding interface with options to view solutions, explanations, and run code. It also shows the code for a function that takes in an array of scores and returns the minimum rewards needed to ensure lower scores get a lower reward than higher scores. The function does this in O(n) time and O(n) space by initializing an output array with rewards of 1, then increasing rewards of higher scores on the first pass and taking the maximum of the current or next reward on the second pass.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    AlgoExpert Quad Layout C++ 12px Sublime Monokai 00:00:00

    Prompt Scratchpad Our Solution(s) Video Explanation Run Code

    Solution 1 Solution 2 Solution 3

    1 // Copyright © 2020 AlgoExpert, LLC. All rights reserved.


    2
    3 #include <algorithm>
    4 #include <vector>
    5 #include <numeric>
    6 using namespace std;
    7
    8 // O(n) time | O(n) space - where in is the length of the input array
    9 int minRewards(vector<int> scores) {
    10 vector<int> rewards = vector<int>(scores.size(), 1);
    11 for (int i = 1; i < scores.size(); i++) {
    12 if (scores[i] > scores[i - 1])
    13 rewards[i] = rewards[i - 1] + 1;
    14 }
    15 for (int i = scores.size() - 2; i >= 0; i--) {
    16 if (scores[i] > scores[i + 1]) {
    17 rewards[i] = max(rewards[i], rewards[i + 1] + 1);
    18 }
    19 }
    20 return accumulate(rewards.begin(), rewards.end(), 0);
    21 }

    You might also like