Submission

Score: 100

User: Phat12

Problemset: เข้าแถว

Language: cpp

Time: 0.007 second

Submitted On: 2025-12-06 23:11:52

/*
TASK: ku01_63o2_queue.cpp
LANG: C++
AUTHOR: Phat
*/
#include <bits/stdc++.h>
#define FO(i,L,R) for (int i = L; i < R; i++)
using namespace std;
int arr[100100];
int arr2[101];
int32_t main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n,m;
    cin >> n >> m;
    for (int i=1;i<=n;i++) cin >> arr[i];
    for (int i=1;i<=m;i++) cin >> arr2[i];
    int idx=1;
    int mx=0;
    for (int i=1;i<=n;i++){
        if (i==arr2[idx]){
            cout << max(0,mx-arr[i]+1) << '\n';
            idx++;
        }
        mx = max(mx,arr[i]);
    }
    return 0;
}