Submission

Score: 100

User: akuyga1

Problemset: เข้าแถว

Language: cpp

Time: 0.008 second

Submitted On: 2025-02-26 14:18:31

#include "bits/stdc++.h"
using namespace std;
#define ii pair<int,int>
#define f first
#define s second
#define mp make_pair


int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int N,K;
	cin>>N>>K;
	vector<int> A(N);
	queue<int> Q;
	for(auto& i:A)cin>>i;
	while(K--){
	    int x;
	    cin>>x;
	    x--;
	    Q.push(x);
	}
	int m=0;
	vector<int> ans;
	for(int i=0;i<N;i++){
	    if(i==Q.front()){
	       // cout<<i<<' '<<A[i]<<' '<<m<<endl;
	        int temp=0;
	        if(A[i]<=m){temp=m+1-A[i];}
	        ans.push_back(temp);
	        Q.pop();
	        if(Q.empty())break;
	    }
	    m=max(A[i],m);
	}
	for(auto i:ans)cout<<i<<'\n';
}