HDD is Outdated Technology(标记有技巧)
2016-07-28 21:35
260 查看
J - HDD is Outdated Technology
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit
Status
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.
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit
Status
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 <cstdio> int abs(int x) { return (x < 0 ? -x : x); } int main() { int pos[200000+11]; int n,i; __int64 ans; while (~scanf ("%d",&n)) { for (i = 1 ; i <= n ; i++) { int t; scanf ("%d",&t); pos[t] = i; } ans = 0; for (int i = 2 ; i <= n ; i++) ans += abs(pos[i] - pos[i-1]); printf ("%I64d\n",ans); } return 0; }//找地址
相关文章推荐
- java算法——分解质因数
- thinkphp介绍及访问方式
- jQuery对象与DOM对象
- Svn与Git的区别
- D3.js 之面包圈图
- Android屏幕适配全攻略(最权威的官方适配指导)
- HDU 1213
- android异常收集- java.lang.NumberFormatException
- 商城项目总结(一)
- Linux基础系列4(ls,cp命令详解)
- android相关素材以及网站
- Html与CSS快速入门03-CSS基础应用
- 层叠上下文(The stacking context)
- HelloWorld
- Linux的文件管理(一)
- java算法——打印100以内的素数
- Spring:源码解读Spring IOC原理
- POJ 1204 Word Puzzles AC自动机 -
- HDOJ 1010 Tempter of the Bone(剪枝+DFS)
- NYOJ-56 阶乘因式分解