Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.002 s | 0 KBi |
#2 |
Correcto
|
0.005 s | 12 KBi |
#3 |
Correcto
|
0.001 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.008 s | 2 KBi |
#8 |
Correcto
|
0.005 s | 2 KBi |
#9 |
Correcto
|
0.002 s | 0 KBi |
#10 |
Correcto
|
0.001 s | 0 KBi |
#11 |
Correcto
|
0.005 s | 27 KBi |
#12 |
Correcto
|
0.004 s | 24 KBi |
#13 |
Correcto
|
0.001 s | 0 KBi |
#14 |
Correcto
|
0.01 s | 2 KBi |
#15 |
Correcto
|
0.002 s | 0 KBi |
#16 |
Correcto
|
0.002 s | 0 KBi |
#17 |
Correcto
|
0.019 s | 5 KBi |
#18 |
Correcto
|
0.008 s | 1 KBi |
#19 |
Correcto
|
0.007 s | 1 KBi |
#20 |
Correcto
|
0.007 s | 1 KBi |
#21 |
Correcto
|
0.02 s | 2 KBi |
#22 |
Correcto
|
0.022 s | 2 KBi |
#23 |
Correcto
|
0.005 s | 1 KBi |
#24 |
Correcto
|
0.012 s | 3 KBi |
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); // your code goes here int n; cin >> n; if(n < 1) return 0; ll arr[n]; ll s, best; cin >> arr[0]; best = arr[0]; for(int i=1;i<n;i++){ cin >> s; arr[i] = max(s, s+arr[i-1]); best = max(best, arr[i]); } cout << best << endl; return 0; }