1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-6
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define NM 100005
#define nm 800005
#define pi 3.1415926535897931
using namespace std;
const ll inf=1e18;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
struct P{
int id,x,y;ll v;
}a[NM],tmp[NM];
int n,m,tot,c[NM];
ll b[NM];
void add(int x){for(;x<=n;x+=lowbit(x))c[x]++;}
int sum(int x,int s=0){for(;x;x-=lowbit(x))s+=c[x];return s;}
void clr(int x){for(;x<=n&&c[x];x+=lowbit(x))c[x]=0;}
bool cmp(P a,P b){return a.id>b.id;}
void cdq(int l,int r){
if(l==r)return;
int mid=l+r>>1,cnt=l;
cdq(l,mid);cdq(mid+1,r);
for(int x=mid,y=r;x>=l||y>mid;)if(x>=l&&(y<=mid||a[x].x>a[y].x)){
add(a[x].y);x--;
}else{
a[y].v+=sum(a[y].y);y--;
}
inc(i,l,mid)clr(a[i].y);
for(int x=l,y=mid+1;x<=mid||y<=r;)if(x<=mid&&(y>r||a[x].x<a[y].x)){
add(a[x].y);
tmp[cnt++]=a[x++];
}else{
a[y].v+=x-l-sum(a[y].y);
tmp[cnt++]=a[y++];
}
inc(i,l,mid)clr(a[i].y);
inc(i,l,r)a[i]=tmp[i];
}
int main(){
n=read();m=read();
inc(i,1,n)b[read()]=i;
dec(i,m,1){
a[++tot].id=i;a[tot].y=read();a[tot].x=b[a[tot].y];b[a[tot].y]=0;
}
inc(i,1,n)if(b[i])a[++tot]=P{0,b[i],i},b[i]=0;
reverse(a+1,a+1+tot);
cdq(1,tot);
sort(a+1,a+1+tot,cmp);
dec(i,tot,1)b[i]=b[i+1]+a[i].v;
inc(i,1,m)printf("%lld\n",b[i]);
return 0;
}
|
