zoukankan      html  css  js  c++  java
  • codeforces 612B HDD is Outdated Technology

    B. 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.

    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 test(s)
    input
    3
    3 1 2
    output
    3
    input
    5
    1 3 5 4 2
    output
    10
    Note

    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>
    #include<cstring>
    #include<map>
    #include<algorithm>
    using namespace std;
    const int maxn=2e5+5;
    typedef long long ll;
    map<int,int>key;
    int main()
    {
        int n;
        int a[maxn];
        scanf("%d",&n);
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            key[a[i]]=i;
        }
        ll ans=0;
        int st=1;
        while(st!=n)
        {
            ans+=abs(key[st+1]-key[st]);
            st++;
        }
        printf("%I64d
    ",ans);
        return 0;
    }
  • 相关阅读:
    缓存之雪崩现象与穿透现象
    Linux下安装php的memcached扩展(memcache的客户端)
    Linux下编译、安装php
    Linux下编译、安装并启动apache
    Linux下编译、安装并启动memcached
    memcached内存分配机制
    Memcached的过期数据的过期机制及删除机制(LRU)
    linux下mysql的root密码忘记----解决方案
    Linux服务管理
    Python中import机制
  • 原文地址:https://www.cnblogs.com/homura/p/5086788.html
Copyright © 2011-2022 走看看