Pagini recente » Cod sursa (job #1179896) | Cod sursa (job #339792) | Cod sursa (job #2942830) | Cod sursa (job #735952) | Cod sursa (job #1171944)
#include <iostream>
#include <fstream>// n(n-1)/2
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[10000];
int f(int a,int b)
{
int s=0;
for(int i=a;i<=b;i++)
s=s+v[i];
return s;
}
int main()
{
int n,a,b;
in>>n;
for(int i=0;i<n;i++)
in>>v[i];
int mx=v[0];
for(int i=0;i<n;i++)
for(int j=i;j<n;j++)
mx=max(mx,f(i,j));
out<<mx;
return 0;
}