Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years. ×

preetham's blog

By preetham, history, 7 months ago, In English,

There are $$$ n $$$ people who are living in their own houses $$$ h_1, h_2, h_3 \dots , h_n $$$ located on the X-axis. A boy who can move with a speed of $$$ 1 unit/sec $$$, needs to visit all the houses. We need to find the minimum waiting time of the people (sum of waiting time of all the people)?

The initial position of the boy is $$$ x $$$

$$$ Constraints : 1 <= n <= 1000, -10^6 <= h_i , x <= 10^6 $$$

Read more »

 
 
 
 
  • Vote: I like it
  • +2
  • Vote: I do not like it