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

  • amazinghacker + 1 comment

    did all the test cases pass?

    • gnawer + 2 comments

      Yes.

      • knikitin + 0 comments
        [deleted]
      • mansi1795 + 3 comments

        i did exactly the same,however it failed two test cases :(

        • kwiatek999 + 3 comments

          I had the same - I think you accumulate the result on an int that is overflowing, try long long

          • vvvincentvan + 0 comments

            I think the problem might be that it's not exactly up or down trends, when you go throuth the sequence from both side, and meet in the middle, you don't have to raise all the value in the left part or the right part. I think the best way is divide and conquer algorithm.

          • enricogiurin + 0 comments

            I had the same 2 tests failing. It was enough to save the sum in a long, rather than in a int.

          • animeshy2jj + 0 comments

            Using long worked for me.

        • nikunj_gupta447 + 4 comments

          try this test case:-

          10
          9 2 3 6 5 4 3 2 2 2

          • vicky2922 + 3 comments
            [deleted]
            • gauravagarwal271 + 0 comments

              how answer will be 20?

            • ranchoparikh + 0 comments
              [deleted]
            • rav_gupta11 + 1 comment

              how it is 20?

              • 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]
          • thakkarjinal99 + 0 comments
            [deleted]
          • smritirastogi33 + 0 comments

            22?

          • rutulpatel2000 + 0 comments
            [deleted]
        • nikitac + 0 comments

          take the data type of result as long long int instead of int