Pagini recente » Cod sursa (job #2982856) | Cod sursa (job #1546779) | Cod sursa (job #1925495) | Cod sursa (job #2724879) | Cod sursa (job #1999817)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int poz1, poz2, s[6000005], n, x, sum, smax=-(1<<31);
void sume(){
sum=0;
for (int i=0; i<n; i++)
{
f >> x;
sum+=x;
s[i]=sum;
}
for (int i=1; i<n; i++)
{
for (int j=0; j<i; j++)
{
sum=s[i]-s[j];
if (sum>smax)
{
smax=sum;
poz1=j+2;
poz2=i+1;
}
}
}
g << smax <<' ' <<poz1 <<' ' <<poz2;
}
int main()
{
f>> n;
sume();
return 0;
}