Pagini recente » Cod sursa (job #2724020) | Cod sursa (job #2783033) | Cod sursa (job #2596884) | Cod sursa (job #1278788) | Cod sursa (job #633776)
Cod sursa(job #633776)
#include <cstdio>
#include <iostream>
using namespace std;
int s[100];
int main()
{
int n,x,max=-1<<15;
freopen("ssm.in","r", stdin);
freopen("ssm.out","w", stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&x);
s[i]=x+s[i-1];
}
//for (int j=1;j<=n;j++) cout<<s[j]<<endl;
for(int i=1;i<=n;i++)
for(int j=1;j<i;j++)
if((s[i]-s[j])>max) max=s[i]-s[j];
printf("%d",max);
return 0;
}