codeforces 612 B. HDD is Outdated Technology

 1#include <cstdio>
 2#include <cstring>
 3#include <iostream>
 4#include <algorithm>
 5#include <vector>
 6#include <queue>
 7#include <set>
 8#include <map>
 9#include <string>
10#include <cmath>
11#include <cstdlib>
12#include <ctime>
13#define fst first
14#define sec second
15#define lson l,m,rt<<1
16#define rson m+1,r,rt<<1|1
17#define ms(a,x) memset(a,x,sizeof(a))
18typedef long long LL;
19#define pi pair < int ,int >
20#define MP make_pair

 1using namespace std;
 2const double eps = 1E-8;
 3const int dx4[4]={1,0,0,-1};
 4const int dy4[4]={0,-1,1,0};
 5const int inf = 0x3f3f3f3f;
 6const int N=2E5+7;
 7int n;
 8struct node
 9{
10    int val;
11    int id;

 1    bool operator <(node b)const
 2    {
 3	return val<b.val;
 4    }
 5}q[N];
 6int main()
 7{
 8	#ifndef  ONLINE_JUDGE 
 9	freopen("code/in.txt","r",stdin);
10  #endif
11	cin>>n;
12	for ( int i = 1 ;  i <= n ; i++ )
13	{
14	    scanf("%d",&q[i].val);
15	    q[i].id = i;
16	}
17	sort(q+1,q+n+1);
18	LL ans = 0 ;
19	q[0].id = 0 ;
20	for ( int i = 1 ; i <= n-1 ; i++)
21	{
22	    ans += LL (abs(q[i+1].id-q[i].id));
23	}
24	cout<<ans<<endl;

1  #ifndef ONLINE_JUDGE  
2  fclose(stdin);
3  #endif
4    return 0;
5}