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.
Loading...
  1. Practice
  2. Algorithms
  3. Greedy
  4. Candies
  5. Discussions

Candies

  • rav_gupta11 + 2 comments

    In your solution '<' should be there instead of '<=', read first solved example.

    • vicky2922 + 0 comments
      [deleted]
    • vicky2922 + 4 comments
          for(int i = 1 ; i < n  ;i++){ //forward track
        if(arr[i] > arr[i-1]){
            dp[i] = dp[i] + dp[i-1]; 
        }
    }

    for(int i = n-2 ; i >= 0 ; i--){ // back track
        if(arr[i] > arr[i+1] && dp[i] <= dp[i+1]){
            dp[i] = dp[i+1] + 1;
        }
    }

    its 22 ..
      • paul_dirac + 0 comments
        [deleted]
      • khushlanipiyush + 1 comment

        I don't think it's a true dp as we are doing reinforcement in the dp array which is not done generally. I also had somewhat same solution but my array name was not dp as mentioned earlier.

        • ariellyrycs + 2 comments

          9 2 3 6 5 4 3 2 2 2

          1,1,2,3,1,1,1,1,1,1 right

          2,1,1,5,4,3,2,1,1,1 left

          find out the max for each reasult

          2,1,2,5,4,3,2,1,1,1

          2+1+2+5+4+3+2+1+1= 20

          • paullb + 0 comments
            [deleted]
          • anmolmittal53 + 0 comments

            brother your maths need to be brushed up first off all you havn't included the last (1) in your result and even if you have not included, you haven't sum up all the values right 2+1+2+5+4+3+2+1+1 = 21

      • yashiagarwal1812 + 0 comments

        how is this working i am unable to get it . could you please explain

      • yashiagarwal1812 + 0 comments
        [deleted]