Codeforces Round #293 (Div. 2) C.Anya and Smartphone（模拟）

题目地址：http://codeforces.com/problemset/problem/518/C

思路：模拟即可

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define debu
using namespace std;
const int maxn=1e5+50;
int n,m,k;
long long ans=0;
int order[maxn],id[maxn];
int main()
{
#ifdef debug
    freopen("in.in","r",stdin);
#endif // debug
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1; i<=n; i++)
    {
        scanf("%d",&order[i]);
        id[order[i]]=i;
    }
    for(int i=1; i<=m; i++)
    {
        int cmd;
        scanf("%d",&cmd);
        ans+=id[cmd]/k+(id[cmd]%k?1:0);
        if(id[cmd]!=1)
        {
            int tmp=id[cmd];
             id[cmd]--,id[order[tmp-1]]++;
             //cout<<cmd<<" "<<id[cmd]<<" "<<order[id[cmd]-1]<<" "<<id[order[id[cmd]-1]]<<endl;
            swap(order[tmp],order[tmp-1]);
        }
       /*for(int i=1;i<=n;i++)
            cout<<order[i]<<" ";
        cout<<ans<<" \n";*/
      /*  for(int i=1;i<=n;i++)
            cout<<id[i]<<" "<<i<<endl;*/
    }
    printf("%I64d\n",ans);
    return 0;
}