Search found 1 match
- Wed Oct 08, 2003 4:43 pm
- Forum: Volume 3 (300-399)
- Topic: 301 - Transportation
- Replies: 13
- Views: 7848
problem 301
What's a good algorithm for problem 301? I can't think of any dynamic programming solution. I'm using recursion but basically it's considering every possible set of orders (with distinct total number of passengers) between two stations and that's why I'm getting TLE.