Submission

Score: 100

User: nemuchannnUwU

Problemset: เข้าแถว

Language: cpp

Time: 0.010 second

Submitted On: 2025-10-17 10:55:10

#include<bits/stdc++.h>
using namespace std;
int main(){
	cin.tie(nullptr)->sync_with_stdio(0);
	int n,m; cin >> n >> m;
	vector<int> h(n);
	vector<int> cus(m);
	for (auto &x : h) cin >> x;
	for (auto &x : cus) cin >> x;
	for (int i=0;i<m;i++){
		int mx=0;
		for (int j=cus[i]-2;j>=0;j--){
			mx=max(mx,h[j]);
		}
		if (h[cus[i]-1]>mx) cout << 0 << "\n";
		else{
			cout << mx-h[cus[i]-1]+1 << "\n";
		}
	}
}