OJ Board

I wonder, where are the problems of the last 'hard' contest? And where is the forums related to it? I like to try submitting the problem 'Bigger is Better'.
I have made a very fast code. I made a dynamic programming approach using C++ code, that is very fast on my machine. (but got TLE)
I will be happy if someone tells me some optimization tricks for this problem?

aminallam wrote:I wonder, where are the problems of the last 'hard' contest?

Here:
http://acmicpc-live-archive.uva.es/nuev ... &year=2006

I cannot submit it, because I use an array:
char D[50][101][3000];
But how can I avoid it, and get the path (the actual string number) at end?