Submission

Status:

PPPPPPPPPP

Score: 100

User: njoop

Problemset: เข้าแถว

Language: cpp

Time: 0.034 second

Submitted On: 2024-11-27 00:46:25

#include <bits/stdc++.h>

using namespace std;

int arr[100010], h[1000010];

int main() {
    int n, l, m;
    cin >> n >> l;
    for(int i=1; i<=n; i++) {
        cin >> arr[i];
        h[i] = arr[i];
        arr[i] = max(arr[i], arr[i-1]);
    }
    while(l--) {
        cin >> m;
        cout << max(0, arr[m-1]+1-h[m]) << "\n";
    }
    return 0;
}