Search found 108 matches
- Sun Aug 30, 2009 5:06 pm
- Forum: Volume 100 (10000-10099)
- Topic: 10051 - Tower of Cubes
- Replies: 19
- Views: 8853
I want to solve this problem by building a graph and running topological sort on it and then finding the longest path in the graph. now for a dense graph I get E = V^2 where V <= 6 * 500 right? (6 positions and 500 cubes maximum) so (6*500)^2 is too much space isn't? (for int array) there is anothe...