ultranoobs's blog

dp

By ultranoobs, history, 6 years ago, In English

i am stuck with this dp problem , can any someone explain me the state of dp for this problem ? problem link is Question

  • Vote: I like it
  • +8
  • Vote: I do not like it

Comments Comments (5)
| Write comment?
»
6 years ago, # |
← Rev. 2   Vote: I like it +11 Vote: I do not like it

This is a difficult DP problem until you know the trick. When would a triangle be invalid? Only when one of the side lengths is >= 1/2 of the total sum. With this in mind we can count how many assignments are invalid triangles, rather than how many assignments are valid triangles. This problem is significantly easier — we have 2 parts to our state: current sum and current item. At each spot we have 2 choices — add to our sum or don't. Succeed when our value reaches 1/2 of the total array sum. Total time is O(2 choices * 300 indexes * 300^2 max sum). We can recover the answer by taking 3^N — 3 * the result of our DP.

→ Reply
  • »
    »
    6 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    What about the difference property. Difference of 2 sides must be smaller than third

    → Reply
    • »
      »
      »
      6 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      That should be covered by the same logic.

      → Reply
      • »
        »
        »
        »
        6 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        What you said isn't much clear. But I understood is by subset sum problem we can find the number of ways to make every sum. Then we can add the counts for the numbers greater than n/2 Is that right

        → Reply
        • »
          »
          »
          »
          »
          6 years ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          If you have |A-C|>B and A+B+C=X then A or C must be >= X/2

          → Reply