Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.007 s | 1 KBi |
#2 |
Correcto
|
0.006 s | 2 KBi |
#3 |
Correcto
|
0.007 s | 2 KBi |
#4 |
Correcto
|
0.005 s | 2 KBi |
#5 |
Correcto
|
0.006 s | 2 KBi |
#6 |
Correcto
|
0.004 s | 1 KBi |
#7 |
Correcto
|
0.008 s | 1 KBi |
#8 |
Correcto
|
0.006 s | 1 KBi |
#9 |
Correcto
|
0.006 s | 1 KBi |
#10 |
Correcto
|
0.004 s | 2 KBi |
#11 |
Correcto
|
0.007 s | 1 KBi |
#12 |
Correcto
|
0.005 s | 1 KBi |
#13 |
Correcto
|
0.005 s | 2 KBi |
#14 |
Correcto
|
0.007 s | 1 KBi |
#15 |
Correcto
|
0.007 s | 1 KBi |
#16 |
Correcto
|
0.004 s | 2 KBi |
#17 |
Incorrecto
|
0.022 s | 2 KBi |
#18 |
Correcto
|
0.032 s | 2 KBi |
#19 |
Correcto
|
0.025 s | 2 KBi |
#20 |
Incorrecto
|
0.02 s | 2 KBi |
#21 |
Incorrecto
|
0.023 s | 2 KBi |
#22 |
Incorrecto
|
0.023 s | 2 KBi |
#23 |
Correcto
|
0.014 s | 2 KBi |
#24 |
Correcto
|
0.013 s | 2 KBi |
/// Write by Daniel Perez .PERAPRO #include<bits/stdc++.h> using namespace std; #define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); using vi=vector<int>; #define pb push_back typedef long long ll; int main(){ fast_io; int n; cin>>n; vi v(n); int nn=0; int gn=-1e9; for(int i=0;i<n;i++){ cin>>v[i]; if(v[i]>=0) nn++; if(v[i]<0) gn=max(gn,v[i]); } int suma; int ans=suma=0; //cout<<ans<<" "<<suma<<endl; for(int i=0;i<n;i++){ suma=max(suma+v[i],v[i]); ans=max(suma,ans); } if(!nn){ cout<<gn<<endl; return 0; } cout<<ans<<endl; }