OJ Board

Hi,

I'm trying to solve this problem with almost same algorithm you've got.
BUT, I don't still have AC..I'm tottely depressed.

First, make hash table
Second, make possible sequence each one word. And then searching hash table whether subsequence is in or not.
Third, If it is existed, save it in ...

Can anyone give me some inputs with outputs? I still got TLE...

Could anybody tell me what's wrong with my code? I don't know why I got TLE. Is the only reason too slow searching time. Because my graph data structure is adjacency matrix.

In my code I used Edmonds-Karp algorithms to search maximum flow and used bellmans-ford to get augment path.

Help Me plz ...