codefroces C：Stack of Presents

原题链接：https://codeforces.ml/contest/1279/problem/C

维护深度，二分找位置即可

代码：

#include <bits/stdc++.h>
#define ll long long
using namespace std;
struct qq
{
    ll a,id;
}q[100010];
ll b[100010],u[100010],n,m;
bool cmp(qq a,qq b)
{
    if(a.a<b.a)
    {return 1;}
    return 0;
}
ll query(ll key)
{
    ll left=0,right=n-1,flag;
    while(left<=right)
    {
        ll mid=(left+right)/2;
        if(q[mid].a>key)
        {right=mid-1;}
        if(q[mid].a<key)
        {left=mid+1;}
        if(q[mid].a==key)
        {flag=q[mid].id;break;}
    }
    return flag;
}
int main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        cin>>n>>m;
        for(int i=0;i<n;i++)
        {cin>>q[i].a;
        u[q[i].a]=i;
        q[i].id=i;}
        for(int i=0;i<m;i++)
        {cin>>b[i];}
        sort(q,q+n,cmp);
        ll ans=0;
        ll op=query(b[0]);
        ans+=op*2+1;
        for(int i=1;i<m;i++)
        {
            if(u[b[i]]<op)
            {ans++;
            continue;}
            else
            {
                ll cxk=query(b[i]);
                op=cxk;
                ans+=(op-i)*2+1;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}