192632025-12-03 12:10:21birozs20G (40 pont)pypy3Runtime error 11/4086ms32000 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/039ms19548 KiB
2Runtime error0/070ms32000 KiB
3Accepted2/243ms19380 KiB
4Accepted2/243ms19396 KiB
5Accepted2/281ms23016 KiB
6Accepted2/285ms22836 KiB
7Accepted3/386ms23744 KiB
8Runtime error0/364ms32000 KiB
9Runtime error0/368ms32000 KiB
10Runtime error0/379ms32000 KiB
11Runtime error0/474ms32000 KiB
12Runtime error0/465ms32000 KiB
13Runtime error0/475ms32000 KiB
14Runtime error0/465ms32000 KiB
15Runtime error0/478ms32000 KiB