A11562 | Almost Difference
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Let's denote a function
You are given an array $a$ consisting of $n$ integers. You have to calculate the sum of $d(a_{i},a_{j})$ over all pairs $(i,j)$ such that $1<=i<=j<=n$ .
You are given an array $a$ consisting of $n$ integers. You have to calculate the sum of $d(a_{i},a_{j})$ over all pairs $(i,j)$ such that $1<=i<=j<=n$ .
输入格式
The first line contains one integer $n$ ( $1<=n<=200000$ ) — the number of elements in $a$ .
The second line contains $n$ integers $a_{1}$ , $a_{2}$ , ..., $a_{n}$ ( $1<=a_{i}<=10^{9}$ ) — elements of the array.
The second line contains $n$ integers $a_{1}$ , $a_{2}$ , ..., $a_{n}$ ( $1<=a_{i}<=10^{9}$ ) — elements of the array.
输出格式
Print one integer — the sum of $d(a_{i},a_{j})$ over all pairs $(i,j)$ such that $1<=i<=j<=n$ .
输入输出样例
输入 #1
5 1 2 3 1 3
输出 #1
4
输入 #2
4 6 6 5 5
输出 #2
0
输入 #3
4 6 6 4 4
输出 #3
-8
In the first example:
1. $d(a_{1},a_{2})=0$ ;
2. $d(a_{1},a_{3})=2$ ;
3. $d(a_{1},a_{4})=0$ ;
4. $d(a_{1},a_{5})=2$ ;
5. $d(a_{2},a_{3})=0$ ;
6. $d(a_{2},a_{4})=0$ ;
7. $d(a_{2},a_{5})=0$ ;
8. $d(a_{3},a_{4})=-2$ ;
9. $d(a_{3},a_{5})=0$ ;
10. $d(a_{4},a_{5})=2$ .
1. $d(a_{1},a_{2})=0$ ;
2. $d(a_{1},a_{3})=2$ ;
3. $d(a_{1},a_{4})=0$ ;
4. $d(a_{1},a_{5})=2$ ;
5. $d(a_{2},a_{3})=0$ ;
6. $d(a_{2},a_{4})=0$ ;
7. $d(a_{2},a_{5})=0$ ;
8. $d(a_{3},a_{4})=-2$ ;
9. $d(a_{3},a_{5})=0$ ;
10. $d(a_{4},a_{5})=2$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted