oj.uz

Submission #2544

# Submission time Handle Problem Language Result Execution time Memory
2544 2013-07-24T00:41:51 Z club4208 줄 세우기 (KOI13_jul) C++
22 / 22
 168 ms 4992 KB 
#include <stdio.h>
int n,t,d[1000001],i,max=0;
int main(){
  scanf("%d",&n);
  for(i=1;i<=n;i++){
    scanf("%d",&t);
    d[t]=d[t-1]+1;
    if(max<d[t])max=d[t];
  }
  printf("%d",n-max);
  return 0;
}

Subtask #1
2.2 / 2.2

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4992 KB Output is correct
2 Correct 0 ms 4992 KB Output is correct
3 Correct 0 ms 4992 KB Output is correct
4 Correct 0 ms 4992 KB Output is correct
5 Correct 0 ms 4992 KB Output is correct

Subtask #2
3.3 / 3.3

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4992 KB Output is correct
2 Correct 0 ms 4992 KB Output is correct
3 Correct 0 ms 4992 KB Output is correct
4 Correct 0 ms 4992 KB Output is correct
5 Correct 0 ms 4992 KB Output is correct

Subtask #3
3.3 / 3.3

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4992 KB Output is correct
2 Correct 0 ms 4992 KB Output is correct
3 Correct 0 ms 4992 KB Output is correct
4 Correct 0 ms 4992 KB Output is correct
5 Correct 0 ms 4992 KB Output is correct

Subtask #4
4.4 / 4.4

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 12 ms 4992 KB Output is correct
4 Correct 28 ms 4992 KB Output is correct
5 Correct 48 ms 4992 KB Output is correct

Subtask #5
4.4 / 4.4

# Verdict Execution time Memory Grader output
1 Correct 76 ms 4992 KB Output is correct
2 Correct 100 ms 4992 KB Output is correct
3 Correct 132 ms 4992 KB Output is correct
4 Correct 164 ms 4992 KB Output is correct
5 Correct 156 ms 4992 KB Output is correct

Subtask #6
4.4 / 4.4

# Verdict Execution time Memory Grader output
1 Correct 168 ms 4992 KB Output is correct
2 Correct 144 ms 4992 KB Output is correct
3 Correct 164 ms 4992 KB Output is correct
4 Correct 156 ms 4992 KB Output is correct
5 Correct 164 ms 4992 KB Output is correct