Pagini recente » Cod sursa (job #1930405) | Cod sursa (job #269550) | Cod sursa (job #794066) | Cod sursa (job #1633015) | Cod sursa (job #1224080)
#include <iostream>
#include <fstream>
#define MAX_LENGTH 6000005
using namespace std;
int sum, seq[MAX_LENGTH];
int main()
{
int n, i, bestSum, left, right;
fstream f("ssm.in", ios::in);
fstream g("ssm.out", ios::out);
f >> n;
for(i = 0 ; i < n ; i++)
f >> seq[i];
bestSum = sum = seq[0];
left = right = 0;
for(i = 1 ; i < n ; i++)
{
if(seq[i] <= sum + seq[i])
sum = sum + seq[i];
else
{
sum = seq[i];
left = i;
}
if(sum > bestSum)
{
bestSum = sum;
right = i;
}
}
g << bestSum << " " << left + 1 << " " << right + 1;
return 0;
}