I've written my program using recursion, and it gets Time Limit Exceded on test #5 :(
Any ideas wold be great.

I use KMP for substring search. And also instead of recursion for finding the shortest combination I use DP. And I get not TLE but WA:(. Must be some technical reasons. But the idea itself is great.

Build graph and use BFS...
It works fast just see http://acm.timus.ru/status.aspx?space=1&num=1002&author=35175

Edited by author 02.08.2006 01:10

And my solution worked too. DP is also suitable for the solution. What I didn't expected is that there is not always (-1) in the end of the input(!!!)

No.. I think all right...

My algo:
Cin >> S;
While (S!="-1")
 {
  Read_Words();
  Build_Graph();
  BFS();
  Write_Ans();
  Cin >> S;
 }

I use dynamic programming.
Time is 0.125s
But memory...12***k

i cant understand - what kind of graph?

Edited by author 04.10.2007 17:42
sdfgdf
Edited by author 04.10.2007 17:42

Edited by author 04.10.2007 17:43

what graph you build?