codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

612B.md (2201B)


      1 Source: https://codeforces.com/problemset/problem/612/B
      2 
      3 B. HDD is Outdated Technology
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 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.
     22 
     23 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.
     24 
     25 Find the time need to read file split to *n* fragments. The *i*-th sector contains the *f**i*-th fragment of the file (1 ≤ *f**i* ≤ *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.
     26 
     27 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.
     28 
     29 Input
     30 
     31 The first line contains a positive integer *n* (1 ≤ *n* ≤ 2·105) — the number of fragments.
     32 
     33 The second line contains *n* different integers *f**i* (1 ≤ *f**i* ≤ *n*) — the number of the fragment written in the *i*-th sector.
     34 
     35 Output
     36 
     37 Print the only integer — the number of time units needed to read the file.
     38 
     39 Examples
     40 
     41 Input
     42 
     43 ```
     44 3  
     45 3 1 2
     46 ```
     47 
     48 Output
     49 
     50 ```
     51 3
     52 ```
     53 
     54 Input
     55 
     56 ```
     57 5  
     58 1 3 5 4 2
     59 ```
     60 
     61 Output
     62 
     63 ```
     64 10
     65 ```
     66 
     67 Note
     68 
     69 In the second example the head moves in the following way:
     70 
     71 * 1->2 means movement from the sector 1 to the sector 5, i.e. it takes 4 time units
     72 * 2->3 means movement from the sector 5 to the sector 2, i.e. it takes 3 time units
     73 * 3->4 means movement from the sector 2 to the sector 4, i.e. it takes 2 time units
     74 * 4->5 means movement from the sector 4 to the sector 3, i.e. it takes 1 time units
     75 
     76 So the answer to the second example is 4 + 3 + 2 + 1 = 10.