Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.004 s | 1 KBi |
#3 |
Correcto
|
0.004 s | 1 KBi |
#4 |
Correcto
|
0.004 s | 1 KBi |
#5 |
Correcto
|
0.004 s | 1 KBi |
#6 |
Correcto
|
0.006 s | 1 KBi |
#7 |
Correcto
|
0.004 s | 2 KBi |
#8 |
Correcto
|
0.005 s | 1 KBi |
#9 |
Correcto
|
0.004 s | 2 KBi |
#10 |
Correcto
|
0.004 s | 1 KBi |
#11 |
Correcto
|
0.003 s | 1 KBi |
#12 |
Correcto
|
0.004 s | 1 KBi |
#13 |
Correcto
|
0.005 s | 1 KBi |
#14 |
Correcto
|
0.004 s | 2 KBi |
#15 |
Correcto
|
0.004 s | 1 KBi |
#16 |
Correcto
|
0.004 s | 1 KBi |
#17 |
Incorrecto
|
0.03 s | 1 KBi |
#18 |
Correcto
|
0.033 s | 1 KBi |
#19 |
Correcto
|
0.032 s | 2 KBi |
#20 |
Incorrecto
|
0.036 s | 2 KBi |
#21 |
Incorrecto
|
0.02 s | 1 KBi |
#22 |
Incorrecto
|
0.032 s | 2 KBi |
#23 |
Correcto
|
0.017 s | 1 KBi |
#24 |
Correcto
|
0.017 s | 1 KBi |
#include <iostream> #include <algorithm> using namespace std; int maxSubarraySum(int arr[], int size) { int maxSum = arr[0]; int sum = arr[0]; for(int i = 1; i < size; i++) { sum = max(arr[i], sum + arr[i]); maxSum = max(maxSum, sum); } return maxSum; } int main() { int n; cin>>n; int arr[n]; for(int i = 0; i < n; i++) { cin>>arr[i]; } cout<<maxSubarraySum(arr, n)<<endl; return 0; }