Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.003 s | 0 KBi |
#2 |
Incorrecto
|
0.004 s | 0 KBi |
#3 |
Incorrecto
|
0.006 s | 1 KBi |
#4 |
Incorrecto
|
0.005 s | 1 KBi |
#5 |
Incorrecto
|
0.004 s | 0 KBi |
#6 |
Correcto
|
0.004 s | 1 KBi |
#7 |
Correcto
|
0.006 s | 1 KBi |
#8 |
Correcto
|
0.008 s | 2 KBi |
#9 |
Incorrecto
|
0.004 s | 17 KBi |
#10 |
Incorrecto
|
0.006 s | 2 KBi |
#11 |
Correcto
|
0.006 s | 4 KBi |
#12 |
Correcto
|
0.007 s | 7 KBi |
#include <iostream> using namespace std; long long a[1000]; int main() { long long n; cin>>n; for(int i=0;i<n;i++){ cin>>n; } for( int i=0;i<n;i++){ if(a[i]>n){ if(a[i-1]>a[i]){ cout<<"Desordenado"<<endl; return 0; } } } cout<<"Ordenado"<<endl; return 0; }