I am not sure If I got the question right 1
4 0 3 1 2 3 1 1 0 2 2 0 3 3 2 0 2 1 2 Isn't the answer that camarade 1 talks to camarade 0 who inturn talks to 2. Isnt this shortest path algorithm? isnt Djikstra O(VlogV) which seems feasible for the problem rite? On 10/30/06, Pradeep Muthukrishnan <[EMAIL PROTECTED]> wrote: > I dont see how Djikstra can be used here? > > > On 10/30/06, Dhyanesh (ધયાનેશ) <[EMAIL PROTECTED]> wrote: > > Djikstra's or any other single-source shortest path algorithm should be > > good enough I guess. > > > > -Dhyanesh > > > > > > > > On 10/30/06, vijay < [EMAIL PROTECTED]> wrote: > > > > > > Anyone know how to solve this problem... > > > http://acmicpc-live-archive.uva.es/nuevoportal/data/problem.php?p=3502 > > > ... > > > I thk its a toughie... > > > > > > > > > > > > > > > > > > > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
