Problem DescriptionnCC lives on the tree which has N nodes.On every leaf of the tree there is an apple(leaf means there is only one branch connect this node ) .Now CC wants to get two apple ,CC can choose any node to start and the speed of CC is one meter per second.n now she wants to know the shortest time to get two apples;n nnInputnThers are many cases;n The first line of every case there is a number N(2<=2000)nci means the len of the branch is ci meters ;n nnOutputnprint the mininum time to get only two apple;n nnSample Inputn7n1 2 1n2 3 2n3 4 1n4 5 1n3 6 3n6 7 4n0n nnSample Outputn5
The project illustrates how to design a simple AJAX web chat application.
We use jQuery, ASP.NET AJAX at client side and Linq to SQL at server side.
In this sample, we could create a chat room and invite someone
else to join in the room and st