HDD is Outdated Technology
来源:互联网 发布:幽浮2知乎 编辑:程序博客网 时间:2024/06/11 04:41
点击打开链接
HDD is Outdated Technology
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.
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.
Print the only integer — the number of time units needed to read the file.
33 1 2
3
51 3 5 4 2
10
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.
ps:一水题,刚开始没看清题意,wc了好几次。话不多说,看代码。
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;struct note{__int64 num;__int64 code;}a[500500];bool cmp(note a,note b){return a.num < b.num ;}int main(){__int64 x,sum,n,i;while(scanf("%I64d",&n)!=EOF){sum=0;for(i=1;i<=n;i++) { scanf("%I64d",&a[i].num ); a[i].code = i ; } sort(a+1,a+n+1,cmp); for(i=1;i<n;i++) { x=a[i+1].code - a[i].code ; if(x<0) x=-x; sum+=x ; // printf("%I64d\n",x); } printf("%I64d\n",sum); } return 0;}
- HDD is Outdated Technology
- HDD is Outdated Technology
- HDD is Outdated Technology
- HDD is Outdated Technology
- 【codeforces】HDD is Outdated Technology
- J - HDD is Outdated Technology
- 【codeforces】HDD is Outdated Technology
- #UPCF Round1 B - 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
- 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(水~)
- 通过ST官方SPL建立STM32FXXX工程
- 树的重心--cf686d Kay and snowflake
- ContentValues和HashTable和HashMap和properties
- opencv 调用 getPerspectiveTransform 函数报错
- TypeError: pivot_table() got an unexpected keyword argument 'rows'
- HDD is Outdated Technology
- unity调用外部的exe
- Confusing Date Format
- idea将maven项目打包成war包的方式,以及使用war包
- 【STL】codeforces 818D Multicolored Cars
- HDU 1848[Fibonacci again and again] 题解
- HDU 3264 Open-air shopping malls
- C# 使用 itextsharp 对pdf文件进行分割的几种方法(1)——按页码拷贝分割
- 设计模式:单例模式-懒汉模型和饿汉模型