oj.uz

Submission #16291

# Submission time Handle Problem Language Result Execution time Memory
16291 2015-08-20T01:19:31 Z khsoo01 줄 세우기 (KOI13_jul) C++
22 / 22
 166 ms 4988 KB 
#import<cstdio>
int n,a,v[1000005],mx;

int main()
{
    int i;
    scanf("%d",&n);
    for(i=0;i<n;i++){
    	scanf("%d",&a);
    	v[a]=v[a-1]+1;
    	if(v[a]>mx)mx=v[a];
    }
    printf("%d",n-mx);
}

Subtask #1
2.2 / 2.2

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

Subtask #2
3.3 / 3.3

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

Subtask #3
3.3 / 3.3

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

Subtask #4
4.4 / 4.4

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4988 KB Output is correct
2 Correct 6 ms 4988 KB Output is correct
3 Correct 14 ms 4988 KB Output is correct
4 Correct 32 ms 4988 KB Output is correct
5 Correct 0 ms 4988 KB Output is correct

Subtask #5
4.4 / 4.4

# Verdict Execution time Memory Grader output
1 Correct 80 ms 4988 KB Output is correct
2 Correct 100 ms 4988 KB Output is correct
3 Correct 54 ms 4988 KB Output is correct
4 Correct 156 ms 4988 KB Output is correct
5 Correct 159 ms 4988 KB Output is correct

Subtask #6
4.4 / 4.4

# Verdict Execution time Memory Grader output
1 Correct 166 ms 4988 KB Output is correct
2 Correct 127 ms 4988 KB Output is correct
3 Correct 114 ms 4988 KB Output is correct
4 Correct 90 ms 4988 KB Output is correct
5 Correct 153 ms 4988 KB Output is correct