1073A- Diverse Substring.cpp

#include<bits/stdc++.h>
using namespace std;

//{
#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d %d",&a,&b);
#define siii(a,b,c) scanf("%d %d %d",&a,&b,&c);

#define sl(a) scanf("%lld",&a)
#define sll(a,b) scanf("%lld %lld",&a,&b);
#define slll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);

#define cel(n,k) ((n-1)/k+1)
#define sets(a) memset(a, -1, sizeof(a))
#define clr(a) memset(a, 0, sizeof(a))
#define max(a,b) ((a)>(b)? (a):(b))
#define min(a,b) ((a)<(b)? (a):(b))
#define fr(n) for(int i=0;i<n;i++)
#define fr1(n) for(int i=1;i<=n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define mp make_pair
#define ff first
#define ss second
#define INF 10000007
#define fastIO() ios_base::sync_with_stdio(false); cin.tie(NULL);

typedef long long i64;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
//}

i64 n, a[200005], step[200005], occur[200005];

main(){
    sets(occur);
    sl(n);

    fr1(n){
        sl(a[i]);
        occur[a[i]]= i;
    }

    i64 num, last=1;


    fr1(n){
        //sl(b[i]);
        sl(num);

        if(occur[num]==-1 || occur[num]<last)
            step[i]= 0;

        else{
            step[i]= occur[num]- last+1;
            last= occur[num]+1;
        }
    }

    printf("%lld",step[1]);
    for(int i=2; i<=n;i++){
        printf(" %lld",step[i]);
    }
    puts("");
}