Submission #1062

#TimeUsernameProblemLanguageResultExecution timeMemory
1062tncks0121줄 세우기 (KOI13_jul)C++98
22 / 22
178 ms8696 KiB
#include <stdio.h> FILE * in = stdin; FILE * out = stdout; int n, a[1000000], d[1000001]; int ans; int main(){ int i; fscanf(in, "%d", &n); for (i=0; i<n; i++) fscanf(in, "%d", &a[i]); ans = n; for (i=0; i<n; i++){ d[a[i]] = d[a[i]-1]+1; if (ans>n-d[a[i]]) ans = n-d[a[i]]; } fprintf(out, "%d", ans); 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...