OJ Board

I tried to solve the problem but i am getting TLE

My algorithm is :

1) Read the words and insert in map
2) generate all edit step words from each word (i) and if the word

exist then add edge between word (i) and the other word
3) DFS to get Max depth

I think it works in 25000*16*26*(log 25000 ...

my algorithm is trying all subsets and check if divisible by m

i think O( n ^ 2)

Can anyone tell me whats the idea of this problem

cause i am getting TLE

thanks

i used longest common subsequence between string A and reversed string A

but i am getting WA

can anyone help me ?? a stupid mistake (small array )

Thanks

Can u Explain your algorithm ..???

Thanks

I am getting wrong answer but i dont know why

can anyone tell me

Here is the code

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;

string s,t1,t2;

int main()
{
//freopen("d.in","rt",stdin);
int t;
int i,j;

cin>>t;
getline(cin,s);
for(i=0;i<t;i ...

i code DP(LCS)using memoization

i am facing a problem in how to find the sequence it self

not how long is it

my function works fine in getting the length of the sequnce

but i dont know how to get the sequence please can anyone help me

here is my function

int LCS (int i , int j)
{

if(i ...