hello guys
I was trying to solve problem EAGLE1 in spoj OJ
the problem gives you a weighted tree and ask you for each node , find farthest node from it
this is very standard dp problem but my code strangely always take runtime error , although I tried different coding styles.
I thought maybe there's something wrong with test cases but I tried to write code that check the validity of test case before processing it but it showed that nothing wrong with the test cases
I'm seeking for help to explain what's happening , here's my code
thank you in advance
looks like a stack overflow
Does spoj have stack size limit?
I have got the same problem while implementing HLD. Try a non-recursive dfs, it works for me
Adding
#pragma comment(linker, '/STACK:200000')to the top of your code gets it accepted :PI've always thought that spoj doesn't limit stack size, thank you for help :)
Did not know either!
Can someone please help me find out where I am wrong code . Thanks in advance