Note: This article is available in Chinese only. 本文暂无英文版本。
View original
http://codeforces.com/contest/612/problem/B 水。
1/* ***********************************************
2Author :111qqz
3Created Time :2015年12月25日 星期五 22时58分38秒
4File Name :code/cf/edu4/B.cpp
5************************************************ */
6
7#include <cstdio>
8#include <cstring>
9#include <iostream>
10#include <algorithm>
11#include <vector>
12#include <queue>
13#include <set>
14#include <map>
15#include <string>
16#include <cmath>
17#include <cstdlib>
18#include <ctime>
19#define fst first
20#define sec second
21#define lson l,m,rt<<1
22#define rson m+1,r,rt<<1|1
23#define ms(a,x) memset(a,x,sizeof(a))
24typedef long long LL;
25#define pi pair < int ,int >
26#define MP make_pair
27
28using namespace std;
29const double eps = 1E-8;
30const int dx4[4]={1,0,0,-1};
31const int dy4[4]={0,-1,1,0};
32const int inf = 0x3f3f3f3f;
33const int N=2E5+7;
34int n;
35struct node
36{
37 int val;
38 int id;
39
40 bool operator <(node b)const
41 {
42 return val<b.val;
43 }
44}q[N];
45int main()
46{
47 #ifndef ONLINE_JUDGE
48 freopen("code/in.txt","r",stdin);
49 #endif
50 cin>>n;
51 for ( int i = 1 ; i <= n ; i++ )
52 {
53 scanf("%d",&q[i].val);
54 q[i].id = i;
55 }
56 sort(q+1,q+n+1);
57 LL ans = 0 ;
58 q[0].id = 0 ;
59 for ( int i = 1 ; i <= n-1 ; i++)
60 {
61 ans += LL (abs(q[i+1].id-q[i].id));
62 }
63 cout<<ans<<endl;
64
65 #ifndef ONLINE_JUDGE
66 fclose(stdin);
67 #endif
68 return 0;
69}