Submission

Score: 100

User: NovemNotes

Problemset: เข้าแถว

Language: cpp

Time: 0.007 second

Submitted On: 2025-10-17 19:10:30

#include <bits/stdc++.h>
using namespace std;

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int n,q;cin >> n >> q;
    vector<int> v(n);
    for(auto &x:v)cin >> x;
    vector<int> m(n+2,0);
    for(int i=1;i<=n;i++){
        m[i]=max(m[i-1],v[i-1]);
    }
    while(q--){
        int x;cin >> x;
        cout << (m[x-1]>=v[x-1]? m[x]-v[x-1]+1 : 0) << "\n";
    }
    return 0;
}