192622025-12-03 12:09:34birozs20G (40 pont)python3Time limit exceeded 11/40400ms14896 KiB
N,Q = map(int,input().split())
lista = map(int,input().split())
maxlista = []
maxepulet = 0
for magassag in lista:
    if magassag > maxepulet:
        maxepulet = magassag
    maxlista.append(maxepulet)
sorszam = []
for i in range(N):
    sorszam.append(i)
megoldas = []
sorszamoriz = sorszam
for i in range(Q):
    M = int(input())
    seged = maxlista  
    while (len(seged)>1):
        kozep = len(seged) // 2
        if seged[kozep-1] > M:
            seged = seged[:kozep]
            sorszam = sorszam[:kozep]
        else:
            seged = seged[kozep:]
            sorszam = sorszam[kozep:]
    megoldas.append(sorszam[0]+1)
    sorszam = sorszamoriz
for szam in megoldas:
    print(szam)
SubtaskSumTestVerdictTimeMemory
base11/40
1Accepted0/014ms3124 KiB
2Time limit exceeded0/0388ms11816 KiB
3Accepted2/216ms2984 KiB
4Accepted2/216ms3388 KiB
5Accepted2/221ms3124 KiB
6Accepted2/239ms3264 KiB
7Accepted3/368ms3272 KiB
8Time limit exceeded0/3391ms14896 KiB
9Time limit exceeded0/3389ms14668 KiB
10Time limit exceeded0/3379ms14892 KiB
11Time limit exceeded0/4386ms14892 KiB
12Time limit exceeded0/4377ms14896 KiB
13Time limit exceeded0/4400ms14752 KiB
14Time limit exceeded0/4400ms14896 KiB
15Time limit exceeded0/4388ms14896 KiB