OJ Board

to Mr. Shahriar Manzoor : I am not agree with you in some cases about ncpc problemset. i know at present there is no very good team in bangladesh ( buet explorer's 2 member retires very soon. ). icpc dhaka regional perfromance was not good ( it was the first contest this year here, 2004 ). but u may ...

Edward,

this is a simple problem and no special case is there. do exactly according to description. first found the rally point(s). for each point find the max distance to all nodes fron the rally node. ( search from 1 to n node. take the max value. suppose there 10 nodes and the rally node is 7 ...

for input 2^31-1 the output is 2^31. so, it's better to use unsigned int or long long .. for this silly mistake i needed 5 submission during the contest to get AC

thanks Eduard

I think it's a nice example of sleep of mind. I missed that tricky part while coding

i have also deleted the I/O. cause it's vey easy to generate formula

I'm getting WA

Input:

Deleted

My Output: