Pagini recente » Cod sursa (job #3242911) | Cod sursa (job #860669) | Cod sursa (job #1859597) | Cod sursa (job #1075335) | Cod sursa (job #495635)
Cod sursa(job #495635)
#include<stdio.h>
int best[6000001];
int main(){
freopen ("ssm.in", "r", stdin);
freopen ("ssm.out", "w", stdout);
int n, i, k;
scanf("%d ", &n);
for(i=1; i<=n; i++){
scanf("%d ", &k);
if(best[i-1]+k>k)
best[i]=best[i-1]+k;
else
best[i]=k;
}
int max=0;
for(i=1; i<=n; i++)
if(best[i]>max)
max=best[i];
printf("%d ", max);
return 0;
}