Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.004 s | 2 KBi |
#3 |
Correcto
|
0.003 s | 1 KBi |
#4 |
Correcto
|
0.005 s | 2 KBi |
#5 |
Correcto
|
0.005 s | 3 KBi |
#6 |
Correcto
|
0.004 s | 2 KBi |
#7 |
Correcto
|
0.005 s | 3 KBi |
#8 |
Correcto
|
0.004 s | 1 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.005 s | 1 KBi |
#11 |
Incorrecto
|
0.006 s | 1 KBi |
#12 |
Correcto
|
0.005 s | 1 KBi |
#13 |
Incorrecto
|
0.006 s | 2 KBi |
#14 |
Correcto
|
0.004 s | 1 KBi |
#15 |
Incorrecto
|
0.005 s | 1 KBi |
#16 |
Correcto
|
0.005 s | 1 KBi |
#17 |
Incorrecto
|
0.006 s | 3 KBi |
#18 |
Correcto
|
0.005 s | 1 KBi |
#19 |
Correcto
|
0.004 s | 1 KBi |
#include <iostream> using namespace std; int main(){ int n; cin >> n; int A[n]; for (int *p = A; p < A + n; p++) { cin >> *p; } int *pi = A; int maxArea = 0; for (; pi < A + n; pi++) { int height = *pi; int tmp = height; for (int *q = pi + 1; q < A + n; q++) { if (*q >= *pi) { tmp += height; } else break; } if (tmp > maxArea) { maxArea = tmp; } } cout << maxArea; return 0; }