Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 1 KBi |
#2 |
Correcto
|
0.004 s | 1 KBi |
#3 |
Correcto
|
0.005 s | 1 KBi |
#4 |
Correcto
|
0.004 s | 2 KBi |
#5 |
Correcto
|
0.004 s | 2 KBi |
#6 |
Incorrecto
|
0.003 s | 1 KBi |
#7 |
Incorrecto
|
0.005 s | 1 KBi |
#8 |
Incorrecto
|
0.005 s | 1 KBi |
#9 |
Correcto
|
0.004 s | 1 KBi |
#10 |
Correcto
|
0.003 s | 2 KBi |
#11 |
Incorrecto
|
0.003 s | 1 KBi |
#12 |
Incorrecto
|
0.005 s | 1 KBi |
#include<stdio.h> int main(){ int n, arr, temp=-1; int c=0; scanf("%d", &n); for(int i=0; i<n; i++){ scanf("%d", &arr); if(arr>temp){ temp=arr; }else { c=1; break; } } if(c==0) printf("Ordenado"); else printf("Desordenado"); return 0; }