Codeforces Round #623 (Div. 2, based on VK Cup 2019-2020 - Elimina F. Moving Points （树状数组）

Huffman_Tree_

于 2020-02-26 01:09:54 发布

阅读量236

点赞数

分类专栏： CodeForces

转载请注明出处//https://blog.csdn.net/qq_43658924

本文链接：https://blog.csdn.net/qq_43658924/article/details/104508974

版权

该博客介绍了如何使用树状数组解决一个关于点在坐标轴上移动，求所有点对之间最小距离之和的问题。题目给出了点的数量、初始坐标和速度，并提供了样例输入输出。思路是通过分析点的速度来确定何时距离会变小，并利用树状数组进行高效处理。

摘要由CSDN通过智能技术生成

F. Moving Points
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
There are n points on a coordinate axis OX. The i-th point is located at the integer point xi and has a speed vi. It is guaranteed that no two points occupy the same coordinate. All n points move with the constant speed, the coordinate of the i-th point at the moment t (t can be non-integer) is calculated as xi+t⋅vi.

Consider two points i and j. Let d(i,j) be the minimum possible distance between these two points over any possible moments of time (even non-integer). It means that if two points i and j coincide at some moment, the value d(i,j) will be 0.

Your task is to calculate the value ∑1≤i<j≤n d(i,j) (the sum of minimum distances over all pairs of points).

Input
The first line of the input contains one integer n (2≤n≤2⋅105) — the number of po