OJ Board

Hi!! Martin

you are right , I have a bug in my code, thanks for that

Thanks in advance
Keep posting.

Hi to all!

I getting WA in this one mi algo is:

if i < j then "i" is senior and j is junior
so I take the diference of S_i - Min ( S_J ) where i<j<=n

then take the maximun of this diferences

Thanks in advance

Hi !! yin_yang2k Is good see that your problem is fine, for the problems of the input in c++ I used a mix between C and C++ for the read input because I consider that C has better read and out that C++, sometimes is uncorfortable write cout<< and << and <<...... etc. but is a opinion very personal, ...

by the way your ouput is fine my program give the same answers

Hope it helps
Keep Posting

Hi !! yin_yang2k I will go to post mi algorithm for take the input cause the algorithm for get the answer is easy, is just take the components conex. int read_graph(graph *g) { int i,j,p,x,y,res1; char c[10],*res2;//this is for take the input initialize_graph(g);//fluhs the graph gets(c);//get the l...

Hi!! Oh Se Jun I post some tests cases in a previous post, did you saw that post ?
if you dont, the link
http://online-judge.uva.es/board/viewtopic.php?t=6354

Hi ! daevon

Thanks for your pront answer

Thanks !!!!!!!! gives me AC !! at last!!!!!!!!!!!! this problem make me mad because I didn't find the error, but with your algo I found, thanks again

Thanks in advance
Keep posting

Hi ! daveon thanks for your pront answer here are a seudo code commented about mi algo I hope that you understead the algo is very simple just iniciliation of arrays and then do dfs, int Deps[102]; Graph graph; int DFS(int v){ if(Deps[v] != -1) return Deps[v]; int sum = 0; // graph[v].size() give th...

Hi ! daveon

thanks for your pront answer

I consider the whole graph but I seek for the best of the values for all the vertices, I think that the best values are from the vertices that have in-degrre = 0 so this vertices are considered in my algo

thanks in advance
Keep posting

Hi !!!! to all I stuck in this problem please help me I use DFS to count the value for every vertex. so I call DFS for every vertex, but I not count the same vertex twice.then I memorize every count for vertex that I used in DFS. finally when I count the value for all vertex , I find the maximum val...

Hi!! I want to know some hints to solve this problem.
I see the problem has a problem of shortest path but repiting nodes, in the sample input they repeat some nodes in the path, please help me

Thanks in advance
keep posting

Thanks ".." for the link makes that the problem was more clear to me :D Thanks Adrian for the hint its really helpfull I did the problem 2935 from the judge of regionals. The part of the problem that still unsolved is graph in general how to see if two graph are equals, I say this because ...

Hi Everyone, I wanted to know everything about How to check if two given graphs are isomorfics.
If there one algo please post seudocode here or mail me, if there one link that can help me please post here, the proposite is implement one rutine for this problem

Thanks in advance

Hi emotional blind !! try with this input
in: out: Hope it helps
Keep posting !!

Thanks to sumankar,misof and Krzysztof Duleba for their quick answers,and advice I solve the problem and Get WA but after somes tries AC The problems was #include <algorithm>
Thanks In Adavance
TO sumankar,misof and Krzysztof Duleba KEEP POSTING !!