@saurabh : I didn't understand. will u give an ex:. if it is a graph(not tree), how can u find longest path in O(n).
On Thu, Apr 5, 2012 at 5:45 PM, Doom <duman...@gmail.com> wrote: > @Don: Any ideas which oppose the above proposed solution? > > > On Saturday, 24 March 2012 21:52:49 UTC+5:30, Don wrote: >> >> Build a graph in which each box is a vertex and there is an edge from >> A to B if B can fit inside A. Then use the longest path algorithm to >> find the solution. >> Don >> >> On Mar 24, 1:55 am, Ratan <success.rata...@gmail.com> wrote: >> > You are given a lot of cuboid boxes with different length, breadth and >> > height. You need to find the maximum subset which can fit into each >> > other. >> > For example: >> > If Box A has LBH as 7 8 9 >> > If Box B has LBH as 5 6 8 >> > If Box C has LBH as 5 8 7 >> > If Box D has LBH as 4 4 4 >> > then answer is A,B,D >> > >> > A box can fit into another only and only if all dimensions of that is >> > less than the bigger box. Also Rotation of boxes is not possible... >> > >> > can ny1 suggest a good algo for this? >> > >> > -- >> > -- >> > Ratan | 3rd Year | Information Technology | NIT ALLAHABAD > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/C1yQ1v_QAboJ. > > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
