OJ Board

all of you try this test: And you will see where is you mistake!

Divide into to 2 groups by n/2 elements each and find for each group a solution with your O(3^n) algo! I have not yet tried this problem but I think it will be right idea!

You could find it here: http://uvatoolkit.com/material.php

My problem was that I used an array of size 1000000 when I increase it I got Ac! Try this!

I just find a mistake in your code)))
look for your inner loop!!!!

not a counter, I use it for the lenght of the string which make this hash!
Then sort and it easy to find the answer! So the complexity is O(n*(n-1)/2)*logN or O(n^2logN)

Yes of course read about Kruskal algorithm!
Here you find a data that needed!

)) map is also a good choice, but I use an array with type of pair<long long,int>!

sorry,maxes I mean!
No I don't use map!

Yes,it was something likes yours!
try to increase the size of array m!

But I could explain my idea here if you want???

There is a service route which start at 0 and ends in (C-1) and the path is 0->1 then 1->2 .......x->(c-1)
So if you reach some city in this path you should follow only this path to reach (c-1)!

Sorry,but I don't save the codes of Ac problems in my computer((

Solve,solve and solve......

Of cousre it will,but this is not a problem it works like you get it by module!