title: Dynamic Programming Problem.. Array Partitioning..
body: <p>The question says,</p>
  
  <p>That given an array of size n, we have to output/partition the array into subsets which sum to N.</p>
  
  <pre><code>For E,g, 
      I/p  arr{2,4,5,7}, n=4, N(sum) = 7(given)
      O/p = {2,5}, {7}
  </code></pre>
  
  <p>I saw similar kind of problem/explanation in the url <a href="http://www.cs.cornell.edu/~wdtseng/icpc/notes/dp3.pdf" rel="nofollow">Dynamic Programming3</a> </p>
  
  <p>And I have the following queries in the pdf:-</p>
  
  <blockquote>
    <blockquote>
      <ol>
      <li>How could we find the subsets which sum to N, as the logic only tells whether the subset exist or not?</li>
      <li>Also, if we change the question a bit, can we find two subsets which has equal average using the same ideology?</li>
      </ol>
    </blockquote>
  </blockquote>
  
  <p>Can anybody thrown some light on this Dynamic Programming problem.. :)</p>
  
  <p>Thanks in Advance..</p>