rohithindustani2004
BAN USERwhat do you mean by minimum degree of connection ???
- rohithindustani2004 July 02, 2012@anonymous : can you explain ???
- rohithindustani2004 May 08, 2012Why don't we put all the n marks at one end , so that the first cut will be proportional to the total length and rest all the n-1 cuts will be free of cost (negligible).
Please let me know your views (and did I understood the question correctly ?)
Why don't we put all the n marks at one end , so that the first cut will be proportional to the total length and rest all the n-1 cuts will be free of cost (negligible).
Please let me know your views (and did I understood the question correctly ?)
You are overwriting the array by replacing elements in first iteration ??? . If its the case yu are defiantly wrong
- rohithindustani2004 January 12, 2012Even I dont believe that its a diameter problem - the values at diameter may be less than some other paths !!!
- rohithindustani2004 October 28, 2011
you are making a wrong assumption that all the arrays contains only positive numbers.
- rohithindustani2004 July 02, 2012