【CodeForces 612B】 HDD is Outdated Technology
来源:互联网 发布:cdn网络 多线程 编辑:程序博客网 时间:2024/04/19 08:48
HDD is Outdated Technology
Description
HDD hard drives group data by sectors. All files are split to fragments and each of them are written in some sector of hard drive. Note the fragments can be written in sectors in arbitrary order.
One of the problems of HDD hard drives is the following: the magnetic head should move from one sector to another to read some file.
Find the time need to read file split to n fragments. The i-th sector contains the fi-th fragment of the file (1 ≤ fi ≤ n). Note different sectors contains the different fragments. At the start the magnetic head is in the position that contains the first fragment. The file are reading in the following manner: at first the first fragment is read, then the magnetic head moves to the sector that contains the second fragment, then the second fragment is read and so on until the n-th fragment is read. The fragments are read in the order from the first to the n-th.
It takes |a - b| time units to move the magnetic head from the sector a to the sector b. Reading a fragment takes no time.
Input
The first line contains a positive integer n (1 ≤ n ≤ 2·105) — the number of fragments.
The second line contains n different integers fi (1 ≤ fi ≤ n) — the number of the fragment written in the i-th sector.
Output
Print the only integer — the number of time units needed to read the file.
Sample Input
Input
3
3 1 2
Output
3
Input
5
1 3 5 4 2
Output
10
Hint
In the second example the head moves in the following way:
1->2 means movement from the sector 1 to the sector 5, i.e. it takes 4 time units
2->3 means movement from the sector 5 to the sector 2, i.e. it takes 3 time units
3->4 means movement from the sector 2 to the sector 4, i.e. it takes 2 time units
4->5 means movement from the sector 4 to the sector 3, i.e. it takes 1 time units
So the answer to the second example is 4 + 3 + 2 + 1 = 10.
#include<stdio.h>#include<math.h>int abs(int t){ return t>0?t:-t;}int main(){ int a[300000+11],i,x,n; __int64 cot; while(scanf("%d",&n)!=EOF) { for(i=1;i<=n;i++) { scanf("%d",&x); a[x]=i; } cot=0; for(i=2;i<=n;i++) { cot+=abs(a[i]-a[i-1]); } printf("%I64d\n",cot); }}
- CodeForces 612B HDD is Outdated Technology
- CodeForces 612B HDD is Outdated Technology
- 【CodeForces】[612B]HDD is Outdated Technology
- CodeForces 612B HDD is Outdated Technology
- CodeForces 612B HDD is Outdated Technology
- HDD is Outdated Technology Codeforces 612B
- 【 Codeforces 612B 】 HDD is Outdated Technology
- 【CodeForces 612B】 HDD is Outdated Technology
- Codeforces 612B HDD is Outdated Technology 【水题】
- CodeForces 612 B. HDD is Outdated Technology(水~)
- 【CodeForces】612B - HDD is Outdated Technology(思维)
- 【Codeforces】-612B-HDD is Outdated Technology(思维)
- 【codeforces】HDD is Outdated Technology
- 【codeforces】HDD is Outdated Technology
- #UPCF Round1 B - HDD is Outdated Technology
- HDD is Outdated Technology
- HDD is Outdated Technology
- HDD is Outdated Technology
- CV | Max Flow / Min Cut 最大流最小割算法学习
- Linux系统真正的优势以及学习方法
- The House Of Santa Claus
- iOS音视频实现边下载边播放
- 教程观看笔记
- 【CodeForces 612B】 HDD is Outdated Technology
- 小Tips—sublime使Handlebars高亮
- android编程基础——Layout
- 笔记
- Hbase--6 Hbase协处理器
- 使用ajax发送请求到WebService,需要在服务器端配置响应头和响应协议
- 算法阅读笔记
- hdu 5475 An easy problem (线段树)
- 你有多了解hybris ?