[Python] SWEA 13569 - gravity

[2022.02.09]

T = int(input())
for tc in range(T):
    N = int(input())
    boxs = list(map(int,input().split()))
    maxmove = 0

    for i in range(N):
        tmp = 0
        # i번째 box 뒷순서 j 높이가 i보다 낮으면 빈공간 => 1씩 더해줌
        for j in range(i+1,N):
            if boxs[i] > boxs[j]:
                tmp += 1
        # maxmove 최대로 갱신
        if maxmove < tmp:
            maxmove = tmp

    print(f'#{tc+1} {maxmove}')