233292026-01-19 17:07:15abcd20G (40 pont)cpp17Accepted 40/4048ms916 KiB
#include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;

int main(){
    int n,q;cin>>n>>q;
    vector<int> v(n);
    for(int i=0;i<n;i++)cin>>v[i];
    vector<array<int,2>> qq(q);
    for(int i=0;i<q;i++){
        cin>>qq[i][0];
        qq[i][1]=i;
    }
    sort(qq.begin(),qq.end());
    vector<int> ans(q);
    int mx=0,id=-1;
    for(int i=0;i<q;i++){
        auto [a,b]=qq[i];
        while(id<n-1&&mx<=a&&v[id+1]<=a){
            id++;
            mx=max(mx,v[id]);
        }
        ans[b]=id+2;
    }
    for(int x:ans)cout<<x<<'\n';
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms500 KiB
2Accepted0/037ms808 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms324 KiB
6Accepted2/22ms316 KiB
7Accepted3/33ms316 KiB
8Accepted3/348ms916 KiB
9Accepted3/346ms804 KiB
10Accepted3/346ms820 KiB
11Accepted4/446ms820 KiB
12Accepted4/446ms808 KiB
13Accepted4/446ms804 KiB
14Accepted4/448ms820 KiB
15Accepted4/446ms800 KiB