Submission

Score: 100

User: qweqwe

Problemset: เข้าแถว

Language: cpp

Time: 0.018 second

Submitted On: 2025-10-16 19:46:32

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define db long double
#define INF 1e15
using namespace std;

int main(){
    int n,l;cin >> n >> l;
    vector<int> qmx(n+1,0),num(n);
    for (int i=1;i<=n;i++){
        cin >> num[i-1];
        qmx[i]=max(qmx[i-1],num[i-1]);
    }
    /*
    for (int i:qmx){
        cout << i << " ";
    }cout << "\n";
    */
    for (int i=0;i<l;i++){
        int a;cin >> a;
        if (num[a-1]>qmx[a-1])cout << qmx[a]-num[a-1] << "\n";
        else cout << qmx[a]-num[a-1]+1 << "\n";
    }
    return 0;
}