Submission

Score: 100

User: Nitro_Legacy

Problemset: เข้าแถว

Language: cpp

Time: 0.021 second

Submitted On: 2026-05-11 00:37:33

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
    ll n, l;
    cin >> n >> l;
    vector<ll> all(n), customers(l);
    for (ll i = 1; i <= n; i++){
        cin >> all[i];
    }
    for (ll i = 1; i <= l; i++){
        cin >> customers[i];
    }
    for (ll i = 1; i <= l; i++){
        ll mx = 0;
        for (ll j = 1; j < customers[i]; j++){
            mx = max (mx, all[j]);
        }
        if (all[customers[i]] > mx ){
            cout << "0";
        } else {
            cout << mx - all[customers[i]] + 1;
        }
        cout << endl;
    }
    return 0;
}