Pagini recente » Cod sursa (job #2298058) | Cod sursa (job #2837757) | Cod sursa (job #2228639) | Cod sursa (job #452350) | Cod sursa (job #1497799)
#include <fstream>
using namespace std;
ifstream fi("ssm.in");
ofstream fo("ssm.out");
long long a[6000007], s , i, j, n, maxim , l , k , lmax, kmax, o;
int main()
{
fi >> n;
for (i = 1; i <= n; i++)
fi >> a[i];
for (i = 1; i <= n; i++)
{ s+=a[i];
if (s < 0)
{
s = 0; l = i; k = i; lmax = i+1;
}
else
{
if (l == 0) l = i; k = i;
if ( maxim < s)
{
maxim = s;
kmax=k;
}
}
}
fo << maxim << " " << lmax << " " << kmax;
return 0;
}