Submission #8529289

Source Code Expand

N = int(input())
P = [int(input()) for _ in range(N)]
Q = [[0] for _ in range(N)]
for i in range(N):
  Q[P[i] - 1] = i

# print(Q)
  
ans = 1
cnt = 1
for i in range(N - 1):
  if Q[i + 1] > Q[i]:
    cnt += 1
    ans = max(ans, cnt)
  else:
    cnt = 1
    
print(N - ans)

Submission Info

Submission Time
Task B - Backfront
User hiraku
Language PyPy3 (2.4.0)
Score 500
Code Size 288 Byte
Status AC
Exec Time 823 ms
Memory 82136 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 28
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 767 ms 82136 KB
02.txt AC 813 ms 82136 KB
03.txt AC 823 ms 82136 KB
04.txt AC 814 ms 82136 KB
05.txt AC 811 ms 82136 KB
06.txt AC 798 ms 82136 KB
07.txt AC 791 ms 82136 KB
08.txt AC 792 ms 82136 KB
09.txt AC 770 ms 82136 KB
10.txt AC 741 ms 82136 KB
11.txt AC 742 ms 82136 KB
12.txt AC 785 ms 82136 KB
13.txt AC 785 ms 82136 KB
14.txt AC 769 ms 82136 KB
15.txt AC 769 ms 82136 KB
16.txt AC 793 ms 82136 KB
17.txt AC 759 ms 82136 KB
18.txt AC 787 ms 82136 KB
19.txt AC 756 ms 82136 KB
20.txt AC 790 ms 82136 KB
21.txt AC 782 ms 82136 KB
22.txt AC 771 ms 82136 KB
23.txt AC 160 ms 38256 KB
24.txt AC 161 ms 38256 KB
25.txt AC 161 ms 38256 KB
s1.txt AC 160 ms 38256 KB
s2.txt AC 161 ms 38256 KB
s3.txt AC 163 ms 38256 KB