Search found 3 matches
Search found 3 matches • Page 1 of 1
- Wed Jun 13, 2007 7:37 am
- Forum: Volume 100 (10000-10099)
- Topic: 10029 - Edit Step Ladders
- Replies: 70
- Views: 21549
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 arra...
- Tue Nov 04, 2003 1:01 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10330 - Power Transmission
- Replies: 43
- Views: 16210
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. Than...