CodeForces 612BHDD is Outdated Technology
来源:互联网 发布:网络修真小说研究 编辑:程序博客网 时间:2024/05/18 03:06
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
33 1 2
3
51 3 5 4 2
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<string.h>#include<math.h>#include<algorithm>using namespace std;struct l{int a;int b;}arr[10010000];bool cmp(l x,l y){return x.a<y.a;}int main(){int n,i;while(~scanf("%d",&n)){for(i=0;i<n;i++){scanf("%d",&arr[i].a);arr[i].b=i;}sort(arr,arr+n,cmp);__int64 sum=0;for(i=1;i<n;i++){sum+=abs(arr[i].b-arr[i-1].b);}printf("%I64d\n",sum);}}
- CodeForces 612BHDD is Outdated Technology
- CodeForces 612BHDD 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
- 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】HDD is Outdated Technology
- 【codeforces】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(思维)
- HDD is Outdated Technology
- HDD is Outdated Technology
- android studio ctrl+左键 查看系统源码
- 蓝桥杯 ALGO-30算法训练 入学考试(01背包,动态规划)
- 套接字描述符的理解
- cocoa touch——UIView——NSLayoutAnchor
- sum of two integers
- CodeForces 612BHDD is Outdated Technology
- 蓝桥杯 ALGO-31算法训练 开心的金明(01背包,动态规划)
- 类的构造函数
- Cpp Primer杂记–extern const的声明注意
- 关键字
- 蓝桥杯 ALGO-21算法训练 装箱问题(动态规划,01背包)
- BZOJ 3998 [TJOI2015]弦论【后缀自动机(总结+安利
- HDU 2438 Turn the corner (三分求极值)
- Socket