Have you tried making it an array of bytes instead of ints? That's 75% savings.
Also,you only need an array of about 1000 entries. See if you can figure out why. -Brian On Sep 12, 4:18 am, ishani parekh <[email protected]> wrote: > Hi, > > Did anyone try out coding for the Large Input set in Problem A in JAVA > ?? The memo strategy used by some coders fails the Java Heap Space :( > because the table to be maintained can get as large as 20000000 * 10 ! > Alternatively how can one decide what the upper bound of the number for a > given set of bases is ?? > > Thanks in Advance. > > Regards, > RosyIsh. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/google-code?hl=en -~----------~----~----~----~------~----~------~--~---
