Submission #1112

#TimeUsernameProblemLanguageResultExecution timeMemory
1112comicos줄 세우기 (KOI13_jul)C++98
22 / 22
180 ms8776 KiB
#include <stdio.h> #define M 1010000 int a [M],d [M]; int main (void) { // freopen ("input29.txt","r",stdin); // freopen ("output.txt","w",stdout); int i,n,cnt = 1,max = 0; scanf ("%d",&n); for (i = 1; i <= n; i++) { scanf ("%d",&a[i]); d [a[i]] = i; } for (i = 1; i <= n; i++) { if (d [i] < d[i + 1]) cnt++; else cnt = 1; if (cnt > max) max = cnt; } printf ("%d",n - max); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...