Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.002 s | 0 KBi |
#2 |
Correcto
|
0.002 s | 0 KBi |
#3 |
Correcto
|
0.002 s | 0 KBi |
#4 |
Correcto
|
0.002 s | 0 KBi |
#5 |
Correcto
|
0.002 s | 0 KBi |
#6 |
Correcto
|
0.002 s | 0 KBi |
#7 |
Correcto
|
0.002 s | 0 KBi |
#8 |
Correcto
|
0.002 s | 0 KBi |
#9 |
Correcto
|
0.003 s | 0 KBi |
#10 |
Correcto
|
0.002 s | 0 KBi |
#11 |
Correcto
|
0.001 s | 0 KBi |
#12 |
Correcto
|
0.002 s | 0 KBi |
#include <bits/stdc++.h> #include <math.h> using namespace std; int main() { int n; cin>>n; int current, prev; bool unordered = false; for(int i = 0; i < n; ++i) { cin>>current; if(i > 0 && !unordered) { unordered = current < prev; } prev = current; } if(unordered) cout<<"Desordenado"<<endl; else cout<<"Ordenado"<<endl; return 0; }